60 search results - page 8 / 12 » On Binary Searching with Nonuniform Costs |
TEC
2002
13 years 7 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
ICALP
2003
Springer
14 years 26 days ago
2003
Springer
We are given a set of jobs each has a processing time, a non-negative weight, a set of possible time intervals in which it can be processed and a cost. The goal is to schedule a f...
ML
2008
ACM
13 years 7 months ago
2008
ACM
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not providing information on the actual object location...
CSCLP
2004
Springer
14 years 1 months ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...