Sciweavers

365 search results - page 23 / 73
» An Approach to Multiply Segmented Constraint Satisfaction Pr...
Sort
View
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 14 days ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
120
Voted
SIAMDM
2010
140views more  SIAMDM 2010»
14 years 10 months ago
Retractions to Pseudoforests
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
Tomás Feder, Pavol Hell, Peter Jonsson, And...
HICSS
1998
IEEE
169views Biometrics» more  HICSS 1998»
15 years 4 months ago
A Transmission-Constrained Unit Commitment Method
This paper presents a transmission-constrained unit commitment method using a Lagrangian relaxation approach. Based on a DC power flow model, the transmission constraints are form...
Chung-Li Tseng, Shmuel S. Oren, C. S. Cheng, C.-A....
SAT
2004
Springer
101views Hardware» more  SAT 2004»
15 years 5 months ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...
CP
2005
Springer
15 years 6 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich