Sciweavers

729 search results - page 51 / 146
» Solving subgraph isomorphism problems with constraint progra...
Sort
View
CSCLP
2007
Springer
15 years 9 months ago
Generalizing Global Constraints Based on Network Flows
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
Igor Razgon, Barry O'Sullivan, Gregory M. Provan
153
Voted
JCO
2011
63views more  JCO 2011»
14 years 6 months ago
Robust multi-sensor scheduling for multi-site surveillance
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
Nikita Boyko, Timofey Turko, Vladimir Boginski, Da...
140
Voted
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 2 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
97
Voted
CP
2004
Springer
15 years 9 months ago
A Domain Consistency Algorithm for the Stretch Constraint
The stretch constraint occurs in many rostering problems that arise in the industrial and public service sectors. In this paper we present an efficient algorithm for domain consist...
Lars Hellsten, Gilles Pesant, Peter van Beek
170
Voted
EMNLP
2006
15 years 5 months ago
Incremental Integer Linear Programming for Non-projective Dependency Parsing
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...
Sebastian Riedel, James Clarke