8647 search results - page 719 / 1730 » The Container Selection Problem |
191
click to vote
CVPR
1996
IEEE
15 years 11 months ago
1996
IEEE
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-red...
206
click to vote
FPL
1997
Springer
15 years 11 months ago
1997
Springer
Technology mapping can be viewed as the optimization problem of finding a minimum cost cover of the given Boolean network by choosing from given library of logic cells. The core of...
187
click to vote
CASES
2007
ACM
15 years 11 months ago
2007
ACM
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...
213
Voted
CAAN
2006
Springer
15 years 11 months ago
2006
Springer
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
211
Voted
AISB
1995
Springer
15 years 11 months ago
1995
Springer
This paper describes a form of dynamical computational system--4he ant colony---and presents an ant colony model for continuous space optimisation problems. The ant colony metapho...