Sciweavers

291 search results - page 4 / 59
» Constraint Satisfaction: The Approximability of Minimization...
Sort
View
ACST
2006
13 years 9 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara
AMAI
2004
Springer
14 years 1 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
13 years 12 months ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram
AAAI
1994
13 years 9 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
GCC
2003
Springer
14 years 26 days ago
An Evolutionary Constraint Satisfaction Solution for over the Cell Channel Routing
A novel combination of genetic algorithms and constraint satisfaction modelling for the solution of two and multi-layer over-thecell channel routing problems is presented. The two ...
Ahmet Ünveren, Adnan Acan