3433 search results - page 120 / 687 » Heuristics for a bidding problem |
190
click to vote
AAAI
2000
15 years 7 months ago
2000
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
198
click to vote
EC
2008
15 years 6 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
143
click to vote
WSC
1998
15 years 7 months ago
1998
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
177
click to vote
MP
1998
15 years 6 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
160
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...