105 search results - page 5 / 21 » Some Applications of Graph Bandwidth to Constraint Satisfact... |
150
click to vote
ICCS
2001
Springer
15 years 8 months ago
2001
Springer
The Sisyphus-I initiative consists of a constraint satisfaction problem in which a group of people in a research environment must be allocated rooms. Numerous constraints are detai...
134
click to vote
CDB
2004
Springer
15 years 9 months ago
2004
Springer
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
124
click to vote
SBACPAD
2003
IEEE
15 years 9 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
126
Voted
KCAP
2005
ACM
15 years 9 months ago
2005
ACM
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
118
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....