Sciweavers

573 search results - page 43 / 115
» Probabilistic Parsing Strategies
Sort
View
MDM
2009
Springer
116views Communications» more  MDM 2009»
14 years 4 months ago
Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
Yuichi Iijima, Yoshiharu Ishikawa
BIRTHDAY
2006
Springer
14 years 1 months ago
A Stochastic Theory of Black-Box Software Testing
Abstract. We introduce a mathematical framework for black-box software testing of functional correctness, based on concepts from stochastic process theory. This framework supports ...
Karl Meinke
IWEC
2004
13 years 11 months ago
Probabilistic Opponent-Model Search in Bao
In Probabilistic Opponent-Model search(PrOM search) the opponent is modelled by a mixed strategy of N opponent types 0 . . .
Jeroen Donkers, H. Jaap van den Herik, Jos W. H. M...
PPSN
2000
Springer
14 years 1 months ago
Spatial Games with Adaptive Tit-For-Tats
This paper presents an adaptive tit-for-tat strategy and a study of its behavior in spatial IPD games. The adaptive tit-for-tat strategy is shown elsewhere to demonstrate high perf...
Elpida Tzafestas
STOC
2001
ACM
161views Algorithms» more  STOC 2001»
14 years 10 months ago
Quantitative solution of omega-regular games
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
Luca de Alfaro, Rupak Majumdar