Sciweavers

653 search results - page 60 / 131
» Factored Planning: How, When, and When Not
Sort
View
SAC
2009
ACM
16 years 1 months ago
Bulk based preconditioning for quantum dot computations
Abstract— This article describes how to accelerate the convergence of Preconditioned Conjugate Gradient (PCG) type eigensolvers for the computation of several states around the b...
Christof Vömel, Stanimire Tomov, Osni Marques
PPSN
2004
Springer
15 years 11 months ago
A Visual Demonstration of Convergence Properties of Cooperative Coevolution
Abstract. We introduce a model for cooperative coevolutionary algorithms (CCEAs) using partial mixing, which allows us to compute the expected long-run convergence of such algorith...
Liviu Panait, R. Paul Wiegand, Sean Luke
AUSAI
2001
Springer
15 years 11 months ago
Actions Made Explicit in BDI
Abstract. The Belief, Desire, Intention (BDI) architecture is increasingly being used in a wide range of complex applications for agents. Many theories and models exist which suppo...
Vineet Padmanabhan, Guido Governatori, Abdul Satta...
VLDB
1992
ACM
120views Database» more  VLDB 1992»
15 years 10 months ago
An Information-Retrieval Approach for Image Databases
The retrieval process in image database systems is inherently different from the retrieval processin traditional (recordoriented)databasesystems.While thelatter canbe consideredan...
Fausto Rabitti, Pasquale Savino
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
15 years 10 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos