738 search results - page 45 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
120
click to vote
PODC
2012
ACM
13 years 4 days ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
HEURISTICS
2010
14 years 7 months ago
2010
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
DAGM
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Approaches to visual navigation, e.g. used in robotics, require computationally efficient, numerically stable, and robust methods for the estimation of ego-motion. One of...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
We describe a new face detection algorithm based on a hierarchy of support vector classifiers (SVMs) designed for efficient computation. The hierarchy serves as a platform for a c...
AUTOMATICA
2010
14 years 9 months ago
2010
: The guarantee of feasibility given feasibility at initial time is an issue that has been overlooked by many of the recent papers on stochastic model predictive control. Effective...