Sciweavers

187 search results - page 15 / 38
» Limits and Possibilities of BDDs in State Space Search
Sort
View
ECCV
2002
Springer
15 years 11 months ago
Space-Time Tracking
Abstract. We propose a new tracking technique that is able to capture non-rigid motion by exploiting a space-time rank constraint. Most tracking methods use a prior model in order ...
Lorenzo Torresani, Christoph Bregler
SOFSEM
2004
Springer
15 years 2 months ago
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...
PUK
2003
14 years 10 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
99
Voted
FMCAD
2004
Springer
15 years 1 months ago
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments...
Orna Grumberg, Assaf Schuster, Avi Yadgar
SPIRE
2004
Springer
15 years 2 months ago
Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays
Abstract Searching information resources using mobile devices is affected by displays on which only a small fraction of the set of ranked documents can be displayed. In this study ...
Vishwa Vinay, Ingemar J. Cox, Natasa Milic-Fraylin...