116 search results - page 15 / 24 » On the solution-space geometry of random constraint satisfac... |
AAAI
2006
14 years 11 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
CP
2006
Springer
15 years 1 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
SMA
2006
ACM
15 years 3 months ago
2006
ACM
Parametric and feature-based CAD models can be considered to represent families of similar objects. In current modelling systems, however, the semantics of such families are uncle...
IJCAI
2001
14 years 11 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
PRICAI
2004
Springer
15 years 2 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...