Sciweavers

3223 search results - page 93 / 645
» The Scaling of Search Cost
Sort
View
AIPS
2009
13 years 10 months ago
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou
ISSRE
2002
IEEE
14 years 2 months ago
Saturation Effects in Testing of Formal Models
Formal analysis of software is a powerful analysis tool, but can be too costly. Random search of formal models can reduce that cost, but is theoretically incomplete. However, rand...
Tim Menzies, David Owen, Bojan Cukic
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
14 years 4 months ago
The Oil Searching Problem
Given n potential oil locations, where each has oil at a certain depth, we seek good trade-offs between the number of oil sources found and the total amount of drilling performed. ...
Andrew McGregor, Krzysztof Onak, Rina Panigrahy
KI
2006
Springer
13 years 9 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
14 years 3 months ago
Cross entropy and adaptive variance scaling in continuous EDA
This paper deals with the adaptive variance scaling issue in continuous Estimation of Distribution Algorithms. A phenomenon is discovered that current adaptive variance scaling me...
Yunpeng Cai, Xiaomin Sun, Hua Xu, Peifa Jia