Sciweavers

10633 search results - page 1652 / 2127
» Relating Distributed Objects
Sort
View
SIROCCO
2004
15 years 5 months ago
Existence of Nash Equilibria in Selfish Routing Problems
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
Alessandro Ferrante, Mimmo Parente
NIPS
1998
15 years 5 months ago
Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
Michael J. Kearns, Satinder P. Singh
WSC
1997
15 years 5 months ago
Selecting the Best System: A Decision-Theoretic Approach
The problem of selecting the best system from a finite set of alternatives is considered from a Bayesian decision-theoretic perspective. The framework presented is quite general,...
Stephen E. Chick
AAAI
1994
15 years 5 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
ADHOC
2007
121views more  ADHOC 2007»
15 years 4 months ago
Power-aware single- and multipath geographic routing in sensor networks
Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a signi...
Shibo Wu, K. Selçuk Candan
« Prev « First page 1652 / 2127 Last » Next »