1963 search results - page 196 / 393 » The Maximum Solution Problem on Graphs |
132
click to vote
AI
2003
Springer
15 years 8 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
145
click to vote
MICRO
2006
IEEE
15 years 9 months ago
2006
IEEE
The superblock is a scheduling region which exposes instruction level parallelism beyond the basic block through speculative execution of instructions. In general, scheduling supe...
131
click to vote
EVOW
2009
Springer
15 years 10 months ago
2009
Springer
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...
140
click to vote
AAAI
1996
15 years 4 months ago
1996
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...
118
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...