Sciweavers

6943 search results - page 717 / 1389
» Representations for evolutionary algorithms
Sort
View
WIA
1997
Springer
15 years 11 months ago
Construction of Efficient Generalized LR Parsers
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
Miguel A. Alonso, David Cabrero, Manuel Vilares Fe...
DMIN
2007
110views Data Mining» more  DMIN 2007»
15 years 9 months ago
Mining for Structural Anomalies in Graph-based Data
—In this paper we present graph-based approaches to mining for anomalies in domains where the anomalies consist of unexpected entity/relationship alterations that closely resembl...
William Eberle, Lawrence B. Holder
UAI
2008
15 years 8 months ago
Sampling First Order Logical Particles
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
Hannaneh Hajishirzi, Eyal Amir
AAAI
2004
15 years 8 months ago
Dynamic Programming for Partially Observable Stochastic Games
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilber...
GIS
2008
ACM
15 years 7 months ago
An ACS cooperative learning approach for route finding in natural environment
This paper introduces an ant-based colony system for the representation of a verbal route description. It is grounded on a natural metaphor that mimics the behavior of ant colonie...
David Brosset, Christophe Claramunt, Eric Saux