1225 search results - page 116 / 245 » The Instance Complexity Conjecture |
CP
2006
Springer
14 years 26 days ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
ICWS
2010
IEEE
13 years 10 months ago
2010
IEEE
This paper addresses one of the major problems of SOA software development: the lack of support for testing complex service-oriented systems. The research community has developed v...
CAGD
2008
13 years 9 months ago
2008
A plane algebraic curve can be represented as the zero-set of a polynomial in two - or if one takes homogenous coordinates: three - variables. The coefficients of the polynomial de...
CONSTRAINTS
2006
13 years 9 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
JAPLL
2010
13 years 7 months ago
2010
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...