481 search results - page 75 / 97 » Anytime Local Search for Distributed Constraint Optimization |
149
click to vote
EVOW
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
106
click to vote
CP
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
118
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
ICIP
2003
IEEE
16 years 2 months ago
2003
IEEE
This paper investigates the use of the Bayesian inference for devising an unsupervised sketch rendering procedure. As likelihood model of this inference, we exploit the recent sta...
171
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
This paper presents a component based deformable
model for generalized face alignment, in which a novel bistage
statistical framework is proposed to account for both
local and g...