Sciweavers

3433 search results - page 55 / 687
» Heuristics for a bidding problem
Sort
View
FLAIRS
2008
13 years 10 months ago
A New Approach to Heuristic Estimations for Cost-Based Planning
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
Raquel Fuentetaja, Daniel Borrajo, Carlos Linares ...
HEURISTICS
2008
92views more  HEURISTICS 2008»
13 years 7 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
FLAIRS
2007
13 years 10 months ago
Random Subsets Support Learning a Mixture of Heuristics
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
Smiljana Petrovic, Susan L. Epstein
INFORMATICALT
2000
113views more  INFORMATICALT 2000»
13 years 7 months ago
An Intensive Search Algorithm for the Quadratic Assignment Problem
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
Alfonsas Misevicius
PKC
2010
Springer
199views Cryptology» more  PKC 2010»
13 years 6 months ago
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
Steven D. Galbraith, Raminder S. Ruprai