Sciweavers

168 search results - page 32 / 34
» Matching as a non-cooperative game
Sort
View
WWW
2006
ACM
15 years 10 months ago
Cat and mouse: content delivery tradeoffs in web access
Web pages include extraneous material that may be viewed as undesirable by a user. Increasingly many Web sites also require users to register to access either all or portions of t...
Balachander Krishnamurthy, Craig E. Wills
ICML
2008
IEEE
15 years 10 months ago
Sample-based learning and search with permanent and transient memories
We present a reinforcement learning architecture, Dyna-2, that encompasses both samplebased learning and sample-based search, and that generalises across states during both learni...
David Silver, Martin Müller 0003, Richard S. ...
ACMICEC
2006
ACM
213views ECommerce» more  ACMICEC 2006»
15 years 3 months ago
CMieux: adaptive strategies for competitive supply chain trading
Supply chains are a central element of today’s global economy. Existing management practices consist primarily of static interactions between established partners. Global compet...
Michael Benisch, Alberto Sardinha, James Andrews, ...
UIST
2004
ACM
15 years 3 months ago
"Killer App" of wearable computing: wireless force sensing body protectors for martial arts
Ubiquitous and Wearable Computing both have the goal of pushing the computer into the background, supporting all kinds of human activities. Application areas include areas such as...
Ed Huai-hsin Chi, Jin Song, Greg Corbin
ICALP
2010
Springer
15 years 2 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket