Sciweavers

3820 search results - page 650 / 764
» Bounded Model Debugging
Sort
View
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 5 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
ATAL
2006
Springer
15 years 5 months ago
A hierarchical approach to efficient reinforcement learning in deterministic domains
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
Carlos Diuk, Alexander L. Strehl, Michael L. Littm...
CAAN
2006
Springer
15 years 5 months ago
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
Fredrik Manne, Qin Xin
FOCS
2004
IEEE
15 years 5 months ago
No Sorting? Better Searching!
Questions about order versus disorder in systems and models have been fascinating scientists over the years. In Computer Science, order is intimately related to sorting, commonly ...
Gianni Franceschini, Roberto Grossi
DCOSS
2006
Springer
15 years 5 months ago
Evaluating Local Contributions to Global Performance in Wireless Sensor and Actuator Networks
Wireless sensor networks are often studied with the goal of removing information from the network as efficiently as possible. However, when the application also includes an actuato...
Christopher J. Rozell, Don H. Johnson