314 search results - page 41 / 63 » A non-binary constraint ordering heuristic for constraint sa... |
AAAI
2006
13 years 9 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
DAM
2000
13 years 7 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
GECCO
1999
Springer
13 years 12 months ago
1999
Springer
Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the sea...
TCAD
1998
13 years 7 months ago
1998
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
nts etc.), an abstract graph of the deployment area and QoS constraints to generate appropriate logical topologies. WIND starts with the set of network elements to be deployed (Nod...