Sciweavers

2834 search results - page 31 / 567
» Representing Trees with Constraints
Sort
View
CPAIOR
2009
Springer
14 years 3 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
COMCOM
2006
120views more  COMCOM 2006»
13 years 9 months ago
Energy efficient routing and scheduling for real-time data aggregation in WSNs
In this paper, we study the problem of constructing an energy efficient data aggregation tree for data gathering in wireless sensor networks. We consider a real-time scenario wher...
Hongwei Du, Xiaodong Hu, Xiaohua Jia
ECAI
2006
Springer
14 years 16 days ago
Last Conflict Based Reasoning
In this paper, we propose an approach to guide search to sources of conflicts. The principle is the following: the last variable involved in the last conflict is selected in priori...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
BNCOD
2004
184views Database» more  BNCOD 2004»
13 years 10 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank
COR
2006
98views more  COR 2006»
13 years 9 months ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve