Sciweavers

711 search results - page 108 / 143
» Amalgams of Constraint Satisfaction Problems
Sort
View
IFIP12
2009
15 years 2 months ago
Defining a Task's Temporal Domain for Intelligent Calendar Applications
Abstract Intelligent calendar assistants have many years ago attracted researchers from the areas of scheduling, machine learning and human computer interaction. However, all effor...
Anastasios Alexiadis, Ioannis Refanidis
AIPS
2003
15 years 5 months ago
Symmetry Reduction for SAT Representations of Transition Systems
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...
Jussi Rintanen
CVPR
2010
IEEE
16 years 28 days ago
A probabilistic image jigsaw puzzle solver
We explore the problem of reconstructing an image from a bag of square, non-overlapping image patches, the jigsaw puzzle problem. Completing jigsaw puzzles is challenging and requ...
Taeg Sang Cho, Shai Avidan, William Freeman
FLAIRS
2007
15 years 6 months ago
Random Subsets Support Learning a Mixture of Heuristics
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
Smiljana Petrovic, Susan L. Epstein
CPAIOR
2008
Springer
15 years 6 months ago
A Novel Approach For Detecting Symmetries in CSP Models
Abstract. While several powerful methods exist for automatically detecting symmetries in instances of constraint satisfaction problems (CSPs), current methods for detecting symmetr...
Christopher Mears, Maria J. García de la Ba...