Sciweavers

6943 search results - page 897 / 1389
» Representations for evolutionary algorithms
Sort
View
SODA
2008
ACM
143views Algorithms» more  SODA 2008»
15 years 8 months ago
Dynamic optimality for skip lists and B-trees
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
Prosenjit Bose, Karim Douïeb, Stefan Langerma...
UAI
2008
15 years 8 months ago
Identifying reasoning patterns in games
We present an algorithm that identifies the reasoning patterns of agents in a game, by iteratively examining the graph structure of its Multi-Agent Influence Diagram (MAID) repres...
Dimitrios Antos, Avi Pfeffer
AIA
2006
15 years 8 months ago
Some Experiments Around a Neural Network for Multimodal Associations
This paper presents a study of the model of triple BAM by [11] which is an improved variation of the original BAM model by [7]. This class of model aims at integrating different s...
Yann Boniface, Reghis Abdelmalek
EMNLP
2006
15 years 8 months ago
Learning Field Compatibilities to Extract Database Records from Unstructured Text
Named-entity recognition systems extract entities such as people, organizations, and locations from unstructured text. Rather than extract these mentions in isolation, this paper ...
Michael L. Wick, Aron Culotta, Andrew McCallum
ICVGIP
2004
15 years 8 months ago
Probabilistic Measures for Motion Segmentation
The first contribution of this paper is a probabilistic approach for measuring motion similarity for point sequences. While most motion segmentation algorithms are based on a rank...
Venu Madhav Govindu