Sciweavers

660 search results - page 63 / 132
» Hybrid CSP Solving
Sort
View
ECAI
2004
Springer
14 years 3 months ago
IPSS: A Hybrid Reasoner for Planning and Scheduling
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
María Dolores Rodríguez-Moreno, Ange...
ICIP
2010
IEEE
13 years 8 months ago
A hybrid fusion method of fingerprint identification for high security applications
Though fingerprint identification is widely used now, its imperfect performance for some high security applications, such as ATM, the access control of nuclear power stations and ...
Yilong Yin, Yanbin Ning, Zhiguo Yang
EDBT
2006
ACM
105views Database» more  EDBT 2006»
14 years 10 months ago
HASE: A Hybrid Approach to Selectivity Estimation for Conjunctive Predicates
Current methods for selectivity estimation fall into two broad categories, synopsis-based and sampling-based. Synopsis-based methods, such as histograms, incur minimal overhead at ...
Xiaohui Yu, Nick Koudas, Calisto Zuzarte
GIS
2007
ACM
14 years 11 months ago
Exploiting automatically inferred constraint-models for building identification in satellite imagery
The building identification (BID) problem is based on a process that uses publicly available information to automatically assign addresses to buildings in satellite imagery. In pr...
Martin Michalowski, Craig A. Knoblock, Kenneth M. ...
CP
2009
Springer
14 years 10 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný