Sciweavers

1639 search results - page 323 / 328
» Anytime Heuristic Search
Sort
View
AI
1998
Springer
13 years 8 months ago
Utility-Based On-Line Exploration for Repeated Navigation in an Embedded Graph
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
Shlomo Argamon-Engelson, Sarit Kraus, Sigalit Sina
JGAA
2002
86views more  JGAA 2002»
13 years 8 months ago
Planar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
Christoph Dornheim
PVLDB
2008
126views more  PVLDB 2008»
13 years 8 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
CEC
2010
IEEE
13 years 7 months ago
Gaussian Adaptation as a unifying framework for continuous black-box optimization and adaptive Monte Carlo sampling
Abstract— We present a unifying framework for continuous optimization and sampling. This framework is based on Gaussian Adaptation (GaA), a search heuristic developed in the late...
Christian L. Müller, Ivo F. Sbalzarini
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 7 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise