Sciweavers

3735 search results - page 542 / 747
» Order compression schemes
Sort
View
IJCAI
2003
15 years 6 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings
UAI
2001
15 years 6 months ago
Vector-space Analysis of Belief-state Approximation for POMDPs
We propose a new approach to value-directed belief state approximationfor POMDPs. The valuedirected model allows one to choose approximation methods for belief state monitoringtha...
Pascal Poupart, Craig Boutilier
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 6 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
WSCG
2004
172views more  WSCG 2004»
15 years 6 months ago
GDESK: Game Discrete Event Simulation Kernel
Simulation has been used traditionally to solve other areas problems. Real time applications like videogames use typically a continuous simulation scheme. That way of operation ha...
Inmaculada García, Ramón Mollá...
PDPTA
2003
15 years 6 months ago
Solipsis: A Massively Multi-Participant Virtual World
—This paper presents a massively shared virtual reality system based on a network of peers. It does not rely on any server nor on IP multicast, and intends to be scalable to an u...
Joaquín Keller, Gwendal Simon