56 search results - page 7 / 12 » Local Branching in a Constraint Programming Framework |
COMSWARE
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— Wireless sensor networks consist of small, inexpensive devices which interact with the environment, communicate with each other, and perform distributed computations in...
HM
2009
Springer
14 years 8 days ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
EMNLP
2007
13 years 9 months ago
2007
Sentence compression holds promise for many applications ranging from summarisation to subtitle generation and subtitle generation. The task is typically performed on isolated sen...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...