Sciweavers

248 search results - page 26 / 50
» The Multi-Story Space Assignment Problem
Sort
View
ICML
1996
IEEE
14 years 11 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
EDBT
2008
ACM
166views Database» more  EDBT 2008»
14 years 11 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
ICRA
2009
IEEE
132views Robotics» more  ICRA 2009»
14 years 5 months ago
On connectivity maintenance in linear cyclic pursuit
— The paper studies the cyclic pursuit problem in presence of connectivity constraints among single-integrator agents. The robots, each one pursuing its leading neighbor along th...
Fabio Morbidi, Giulio Ripaccioli, Domenico Prattic...
ENC
2005
IEEE
14 years 4 months ago
Saving Evaluations in Differential Evolution for Constrained Optimization
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
Efrén Mezura-Montes, Carlos A. Coello Coell...
SAT
2004
Springer
106views Hardware» more  SAT 2004»
14 years 4 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski