Sciweavers

1185 search results - page 62 / 237
» The Equivalence of Sampling and Searching
Sort
View
TSE
2010
120views more  TSE 2010»
13 years 2 months ago
Efficient Software Verification: Statistical Testing Using Automated Search
Statistical testing has been shown to be more efficient at detecting faults in software than other methods of dynamic testing such as random and structural testing. Test data are g...
Simon M. Poulding, John A. Clark
CEC
2009
IEEE
14 years 2 months ago
Plateau Connection Structure and multiobjective metaheuristic performance
—This paper proposes the plateau structure imposed by the Pareto dominance relation as a useful determinant of multiobjective metaheuristic performance. In essence, the dominance...
Deon Garrett
ISAAC
2003
Springer
104views Algorithms» more  ISAAC 2003»
14 years 1 months ago
Deterministic Algorithm for the t-Threshold Set Problem
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
Jérémy Barbay, Claire Kenyon
AAAI
2007
13 years 10 months ago
Action-Space Partitioning for Planning
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...
Natalia Hernandez-Gardiol, Leslie Pack Kaelbling
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 9 months ago
On external memory graph traversal
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first se...
Adam L. Buchsbaum, Michael H. Goldwasser, Suresh V...