Sciweavers

85 search results - page 5 / 17
» A Hybrid Approach to Distributed Constraint Satisfaction
Sort
View
JUCS
2007
118views more  JUCS 2007»
14 years 11 months ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
JAIR
2010
145views more  JAIR 2010»
14 years 10 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
80
Voted
FLAIRS
2004
15 years 1 months ago
Constraint Processing with Reactive Agents
The integration of methods of Constraint Programming and Multi-Agent-Systems is discussed in this paper. We describe different agent topologies for Constraint Satisfaction Problem...
Georg Ringwelski, Richard J. Wallace
ICS
2003
Tsinghua U.
15 years 4 months ago
PowerHerd: dynamic satisfaction of peak power constraints in interconnection networks
Power consumption is a critical issue in interconnection network design, driven by power-related design constraints, such as thermal and power delivery design. Usually, off-line w...
Li Shang, Li-Shiuan Peh, Niraj K. Jha
103
Voted
IJCNN
2006
IEEE
15 years 5 months ago
Job-Shop Scheduling with an Adaptive Neural Network and Local Search Hybrid Approach
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
Shengxiang Yang