1381 search results - page 53 / 277 » Computational Complexity of Constraint Satisfaction |
135
Voted
COSIT
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. The Double Cross calculus has been proposed for the purpose of navigation based on qualitative information about spatial configurations. Up until now, however, no result...
221
click to vote
NFM
2011
14 years 10 months ago
2011
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
153
click to vote
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
Although recent research has shown that the complexity of a network depends on its structural organization, which is linked to the functional constraints the network must satisfy, ...
149
click to vote
AI
2008
Springer
15 years 4 months ago
2008
Springer
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
125
click to vote
PUK
2001
15 years 5 months ago
2001
Combination of AI/OR methods is gaining a great deal of attention because many combinatorial problems especially in planning and scheduling areas can be solved by means of combined...