Sciweavers

2107 search results - page 127 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
AIIDE
2008
15 years 5 months ago
The Rise of Potential Fields in Real Time Strategy Bots
Bots for Real Time Strategy (RTS) games are challenging to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while at the s...
Johan Hagelbäck, Stefan J. Johansson
IAT
2003
IEEE
15 years 8 months ago
Modeling Agent-Based Load Balancing with Time Delays
In grid computing, agent-based load balancing is one of the most important problems. In this paper, we present a macroscopic model to describe the dynamics of agent-based load bal...
Yuanshi Wang, Jiming Liu, Xiaolong Jin
120
Voted
PODC
2009
ACM
16 years 4 months ago
Concurrent imitation dynamics in congestion games
Imitating successful behavior is a natural and frequently applied approach to trust in when facing scenarios for which we have little or no experience upon which we can base our d...
Heiner Ackermann, Petra Berenbrink, Simon Fischer,...
185
Voted
PODC
2012
ACM
13 years 6 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
163
Voted
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
15 years 8 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...