Sciweavers

1403 search results - page 219 / 281
» About Approximations of Exponentials
Sort
View
99
Voted
ATAL
2003
Springer
15 years 6 months ago
Coordination in multiagent reinforcement learning: a Bayesian approach
Much emphasis in multiagent reinforcement learning (MARL) research is placed on ensuring that MARL algorithms (eventually) converge to desirable equilibria. As in standard reinfor...
Georgios Chalkiadakis, Craig Boutilier
103
Voted
ATAL
2003
Springer
15 years 6 months ago
Towards a motivation-based approach for evaluating goals
Traditional goal-oriented approaches to building intelligent agents only consider absolute satisfaction of goals. However, in continuous domains there may be many instances in whi...
Stephen J. Munroe, Michael Luck, Mark d'Inverno
98
Voted
ECAL
2003
Springer
15 years 6 months ago
Critical Values in Asynchronous Random Boolean Networks
Abstract Wherever we see life, we see different kinds of complex networks, reason why they are studied across various fields of science. Random Boolean Networks (RBNs) form a spe...
Bertrand Mesot, Christof Teuscher
132
Voted
IMR
2003
Springer
15 years 6 months ago
Meshing Complexity of Single Part CAD Models
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
David R. White, Sunil Saigal, Steven J. Owen
99
Voted
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
15 years 6 months ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig