Sciweavers

115 search results - page 15 / 23
» On the Complexity of the Highway Pricing Problem
Sort
View
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 8 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
ADC
2005
Springer
106views Database» more  ADC 2005»
14 years 1 months ago
OS Support for a Commodity Database on PC clusters - Distributed Devices vs. Distributed File Systems
In this paper we attempt to parallelise a commodity database for OLAP on a cluster of commodity PCs by using a distributed high-performance storage subsystem. By parallelising the...
Felix Rauch, Thomas Stricker
AAAI
2010
13 years 9 months ago
Hidden Market Design
The next decade will see an abundance of new intelligent systems, many of which will be market-based. Soon, users will interact with many new markets, perhaps without even knowing...
Sven Seuken, Kamal Jain, David C. Parkes
AMEC
2004
Springer
14 years 28 days ago
Revenue Failures and Collusion in Combinatorial Auctions and Exchanges with VCG Payments
Abstract. In a combinatorial auction, there are multiple items for sale, and bidders are allowed to place a bid on a bundle of these items rather than just on the individual items....
Vincent Conitzer, Tuomas Sandholm
JAIR
2000
152views more  JAIR 2000»
13 years 7 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht