Sciweavers

506 search results - page 33 / 102
» Automated Search for Heuristic Functions
Sort
View
IJEB
2010
81views more  IJEB 2010»
13 years 5 months ago
Investigating the functionality and performance of online shopping bots for electronic commerce: a follow-up study
: Shopping bots are automated software applications that allow consumers to easily search for and compare product prices from online retailers. In a previous project, researchers i...
Alexander Serenko, James Hayes
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
13 years 8 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe
AIPS
2008
13 years 10 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
SBMF
2010
Springer
129views Formal Methods» more  SBMF 2010»
13 years 2 months ago
Directed Model Checking for B: An Evaluation and New Techniques
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
Michael Leuschel, Jens Bendisposto
AIPS
2006
13 years 9 months ago
Fast Probabilistic Planning through Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
Carmel Domshlak, Jörg Hoffmann