1647 search results - page 212 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
109
click to vote
WEA
2007
Springer
15 years 8 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
117
Voted
PODC
2009
ACM
16 years 3 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
150
click to vote
ATAL
2011
Springer
14 years 2 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
127
click to vote
ICMLA
2009
15 years 5 days ago
2009
This article proposes an algorithm to automatically learn useful transformations of data to improve accuracy in supervised classification tasks. These transformations take the for...
120
click to vote
FLAIRS
2007
15 years 4 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...