Sciweavers

243 search results - page 6 / 49
» How to Solve It Automatically: Selection Among Problem Solvi...
Sort
View
FLAIRS
2007
15 years 12 hour 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
STOC
2009
ACM
118views Algorithms» more  STOC 2009»
15 years 4 months ago
How long does it take to catch a wild kangaroo?
The discrete logarithm problem asks to solve for the exponent x, given the generator g of a cyclic group G and an element h ∈ G such that gx = h. We give the first rigorous pro...
Ravi Montenegro, Prasad Tetali
74
Voted
CSDA
2006
96views more  CSDA 2006»
14 years 9 months ago
Analysis of new variable selection methods for discriminant analysis
Several methods to select variables that are subsequently used in discriminant analysis are proposed and analysed. The aim is to find from among a set of m variables a smaller sub...
Joaquín A. Pacheco, Silvia Casado, Laura N&...
AAAI
1997
14 years 11 months ago
Structured Solution Methods for Non-Markovian Decision Processes
Markov Decision Processes (MDPs), currently a popular method for modeling and solving decision theoretic planning problems, are limited by the Markovian assumption: rewards and dy...
Fahiem Bacchus, Craig Boutilier, Adam J. Grove
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 1 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch