7596 search results - page 1175 / 1520 » Challenges in forensic computing |
206
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
219
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
170
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
Agents in a multi-agent system do not act in a vacuum. The outcome of their efforts depends on the environment in which they seek to act, and in particular on the efforts of other...
178
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
In modern racing games programming non-player characters with believable and sophisticated behaviors is getting increasingly challenging. Recently, several works in the literature ...
199
click to vote
CCCG
2009
15 years 8 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...