Sciweavers

1368 search results - page 4 / 274
» Perfect Local Computability and Computable Simulations
Sort
View
SENSYS
2003
ACM
15 years 2 months ago
On the effect of localization errors on geographic face routing in sensor networks
In the absence of location errors, geographic routing - using a combination of greedy forwarding and face routing - has been shown to work correctly and efficiently. The effects o...
Karim Seada, Ahmed Helmy, Ramesh Govindan
66
Voted
PRIMA
2007
Springer
15 years 3 months ago
Multiagent Planning with Trembling-Hand Perfect Equilibrium in Multiagent POMDPs
Multiagent Partially Observable Markov Decision Processes are a popular model of multiagent systems with uncertainty. Since the computational cost for finding an optimal joint pol...
Yuichi Yabu, Makoto Yokoo, Atsushi Iwasaki
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
15 years 2 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
83
Voted
DAC
1996
ACM
15 years 1 months ago
Computing Parametric Yield Adaptively Using Local Linear Models
Abstract A divide-and-conquer algorithm for computing the parametric yield of large analog circuits is presented. The algorithm targets applications whose performance spreads could...
Mien Li, Linda S. Milor
78
Voted
NN
2008
Springer
114views Neural Networks» more  NN 2008»
14 years 9 months ago
Event detection and localization for small mobile robots using reservoir computing
Reservoir Computing (RC) techniques use a fixed (usually randomly created) recurrent neural network, or more generally any dynamic system, which operates at the edge of stability,...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...