Sciweavers

858 search results - page 118 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
SAC
2005
ACM
14 years 1 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
SAT
2004
Springer
101views Hardware» more  SAT 2004»
14 years 1 months ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...
STDBM
2004
Springer
171views Database» more  STDBM 2004»
14 years 1 months ago
Extracting Mobility Statistics from Indexed Spatio-Temporal Datasets
With the recent progress of spatial information technologies and mobile computing technologies, spatio-temporal databases which store information on moving objects including vehicl...
Yoshiharu Ishikawa, Yuichi Tsukamoto, Hiroyuki Kit...
AUSAI
2007
Springer
13 years 11 months ago
Branching Rules for Satisfiability Analysed with Factor Analysis
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
Richard J. Wallace, Stuart Bain
CP
2006
Springer
13 years 11 months ago
Decomposition of Multi-operator Queries on Semiring-Based Graphical Models
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
Cédric Pralet, Thomas Schiex, Gérard...