Sciweavers

551 search results - page 48 / 111
» Continuous Search in Constraint Programming
Sort
View
EOR
2008
133views more  EOR 2008»
13 years 9 months ago
Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
Constrained Optimization Problems (COP) often take place in many practical applications such as kinematics, chemical process optimization, power systems and so on. These problems ...
Chandra Sekhar Pedamallu, Linet Özdamar
ADHOCNOW
2009
Springer
14 years 3 months ago
SenSearch: GPS and Witness Assisted Tracking for Delay Tolerant Sensor Networks
Abstract— Mobile wireless sensor networks have to be robust against the limitations of the underlying platform. While lightweight form factor makes them an attractive choice for ...
Lun Jiang, Jyh-How Huang, Ankur Kamthe, Tao Liu, I...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 6 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
CP
2007
Springer
14 years 3 months ago
Encodings of the Sequence Constraint
Abstract. The SEQUENCE constraint is useful in modelling car sequencing, rostering, scheduling and related problems. We introduce half a dozen new encodings of the SEQUENCE constra...
Sebastian Brand, Nina Narodytska, Claude-Guy Quimp...
SARA
2009
Springer
14 years 3 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...