Sciweavers

1639 search results - page 143 / 328
» Anytime Heuristic Search
Sort
View
COR
2010
150views more  COR 2010»
13 years 10 months ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...
DKE
2002
107views more  DKE 2002»
13 years 10 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
PVLDB
2008
77views more  PVLDB 2008»
13 years 9 months ago
Efficient network aware search in collaborative tagging sites
The popularity of collaborative tagging sites presents a unique opportunity to explore keyword search in a context where query results are determined by the opinion of a network o...
Sihem Amer-Yahia, Michael Benedikt, Laks V. S. Lak...
TSE
2010
123views more  TSE 2010»
13 years 4 months ago
Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking
Current stochastic model checkers do not make counterexamples for property violations readily available. In this paper we apply directed explicit state space search to discrete- a...
Husain Aljazzar, Stefan Leue
AIPS
2011
13 years 1 months ago
Searching for Plans with Carefully Designed Probes
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
Nir Lipovetzky, Hector Geffner