Sciweavers

3433 search results - page 164 / 687
» Heuristics for a bidding problem
Sort
View
ECML
2003
Springer
15 years 11 months ago
Experiments with Cost-Sensitive Feature Evaluation
Many machine learning tasks contain feature evaluation as one of its important components. This work is concerned with attribute estimation in the problems where class distribution...
Marko Robnik-Sikonja
IPL
2007
74views more  IPL 2007»
15 years 6 months ago
Nonnegative integral subset representations of integer sets
We consider an integer-subset representation problem motivated by a medical application in radiation therapy. We prove NP-completeness, derive nontrivial bounds, and report on the...
Michael J. Collins, David Kempe, Jared Saia, Maxwe...
CP
2004
Springer
15 years 12 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
DAC
1994
ACM
15 years 10 months ago
New Techniques for Efficient Verification with Implicitly Conjoined BDDs
-- In previous work, Hu and Dill identified a common cause of BDD-size blowup in high-level design verification and proposed the method of implicitly conjoined invariants to addres...
Alan J. Hu, Gary York, David L. Dill
HEURISTICS
2002
108views more  HEURISTICS 2002»
15 years 6 months ago
Cooperative Parallel Tabu Search for Capacitated Network Design
We present a cooperative parallel tabu search method for the fixed charge, capacitated, multicommodity network design problem. Several communication strategies are analyzed and co...
Teodor Gabriel Crainic, Michel Gendreau