Sciweavers

337 search results - page 48 / 68
» An Anytime Algorithm for Decision Making under Uncertainty
Sort
View
RSA
2008
80views more  RSA 2008»
13 years 6 months ago
The persistent-access-caching algorithm
ABSTRACT: Caching is widely recognized as an effective mechanism for improving the performance of the World Wide Web. One of the key components in engineering the Web caching syste...
Predrag R. Jelenkovic, Ana Radovanovic
ACMMSP
2006
ACM
260views Hardware» more  ACMMSP 2006»
14 years 1 months ago
Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms
A blossoming paradigm for block-recursive matrix algorithms is presented that, at once, attains excellent performance measured by • time, • TLB misses, • L1 misses, • L2 m...
Michael D. Adams, David S. Wise
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 7 months ago
Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization
Solving stochastic optimization problems under partial observability, where one needs to adaptively make decisions with uncertain outcomes, is a fundamental but notoriously diffic...
Daniel Golovin, Andreas Krause
MOBICOM
2000
ACM
13 years 12 months ago
GPSR: greedy perimeter stateless routing for wireless networks
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to ma...
Brad Karp, H. T. Kung
IOR
2007
119views more  IOR 2007»
13 years 7 months ago
A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow
We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...
Alfredo Garcia, Stephen D. Patek, Kaushik Sinha