Sciweavers

932 search results - page 100 / 187
» Where in the Wikipedia Is That Answer
Sort
View
AIIDE
2008
13 years 10 months ago
Logical Agents for Language and Action
Game developers are faced with the difficult task of creating non-player characters with convincing behavior. This commonly involves an exhaustive specification of their actions i...
Martin Magnusson, Patrick Doherty
DAGSTUHL
2004
13 years 9 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
13 years 9 months ago
Suffix Arrays: A New Method for On-Line String Searches
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
Udi Manber, Gene Myers
29
Voted
CCIA
2009
Springer
13 years 9 months ago
Interaction, observance or both? Study of the effects on convention emergence
Abstract. Social conventions are useful self-sustaining protocols for groups to coordinate behavior without a centralized entity enforcing coordination. The emergence of such conve...
Daniel Villatoro, Jordi Sabater-Mir, Sandip Sen
ARSCOM
2008
192views more  ARSCOM 2008»
13 years 8 months ago
Bounds on the metric and partition dimensions of a graph
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
Glenn G. Chappell, John G. Gimbel, Chris Hartman