Sciweavers

239 search results - page 17 / 48
» The Parameterized Complexity of Global Constraints
Sort
View
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 7 months ago
Dynamic System Adaptation by Constraint Orchestration
Abstract. For Paradigm models, evolution is just-in-time specified coordination conducted by a special reusable component McPal. Evolution can be treated consistently and on-the-fl...
Luuk Groenewegen, Erik P. de Vink
CEC
2010
IEEE
13 years 8 months ago
Constrained global optimization of low-thrust interplanetary trajectories
The optimization of spacecraft trajectories can be formulated as a global optimization task. The complexity of the problem depends greatly on the problem formulation, on the spacec...
Chit Hong Yam, David Di Lorenzo, Dario Izzo
CPAIOR
2009
Springer
14 years 2 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
TCAD
2008
68views more  TCAD 2008»
13 years 7 months ago
Highly Efficient Gradient Computation for Density-Constrained Analytical Placement
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
Jason Cong, Guojie Luo, Eric Radke
ICDE
2008
IEEE
214views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Online Subsequence Searching in Data Streams under Dynamic Time Warping Distance
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...
Mi Zhou, Man Hon Wong