Sciweavers

285 search results - page 46 / 57
» The complexity of soft constraint satisfaction
Sort
View
84
Voted
KBSE
1997
IEEE
15 years 1 months ago
Genetic Algorithms for Dynamic Test Data Generation
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
Christoph C. Michael, Gary McGraw, Michael Schatz,...
IJCAI
2007
14 years 11 months ago
Arc Consistency during Search
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
Chavalit Likitvivatanavong, Yuanlin Zhang, Scott S...
MICCAI
2007
Springer
15 years 10 months ago
Interactive Contacts Resolution Using Smooth Surface Representation
Accurately describing interactions between medical devices and anatomical structures, or between anatomical structures themselves, is an essential step towards the adoption of comp...
Jérémie Dequidt, Julien Lenoir, Step...
93
Voted
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
15 years 3 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
KBSE
2006
IEEE
15 years 3 months ago
Modularity Analysis of Logical Design Models
Traditional design representations are inadequate for generalized reasoning about modularity in design and its technical and economic implications. We have developed an architectu...
Yuanfang Cai, Kevin J. Sullivan