Sciweavers

1047 search results - page 25 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
AGENTS
2001
Springer
14 years 7 days ago
Terrain coverage with ant robots: a simulation study
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...
Sven Koenig, Yaxin Liu
SETN
2004
Springer
14 years 1 months ago
Integrating miniMin-HSP Agents in a Dynamic Simulation Framework
Abstract. In this paper, we describe the framework created for implementing AI-based animations for artificial actors in the context of IVE (Intelligent Virtual Environments). The...
Miguel Lozano, Francisco Grimaldo, Fernando Barber
GECCO
2007
Springer
258views Optimization» more  GECCO 2007»
13 years 11 months ago
TFBS identification by position- and consensus-led genetic algorithm with local filtering
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...
Tak-Ming Chan, Kwong-Sak Leung, Kin-Hong Lee
PODS
2010
ACM
150views Database» more  PODS 2010»
14 years 24 days ago
Understanding queries in a search database system
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram R...
CPAIOR
2009
Springer
14 years 2 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin