1746 search results - page 191 / 350 » A linear implementation of PACMAN |
124
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
One approach to moderating the expected behaviour of agents in open societies is the use of explicit languages for defining norms, conditional commitments and/or social expectation...
131
Voted
FPL
2008
Springer
15 years 5 months ago
2008
Springer
Most high-speed Internet Protocol (IP) lookup implementations use tree traversal and pipelining. However, this approach results in inefficient memory utilization. Due to available...
107
Voted
AAAI
2010
15 years 5 months ago
2010
Trial-based approaches offer an efficient way to solve singleagent MDPs and POMDPs. These approaches allow agents to focus their computations on regions of the environment they en...
127
click to vote
APVIS
2008
15 years 5 months ago
2008
We present a technique for memory-efficient and time-efficient volume rendering of curvilinear adaptive mesh refinement data defined within extrudable computational spaces. One of...
120
Voted
DAGSTUHL
2007
15 years 5 months ago
2007
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...