Sciweavers

500 search results - page 22 / 100
» On the Hardness of Being Truthful
Sort
View
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
15 years 2 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
RTAS
2008
IEEE
15 years 3 months ago
Throttling On-Disk Schedulers to Meet Soft-Real-Time Requirements
To achieve better throughput, many hard drive manufacturers use internal queues and scheduling to take advantage of vendor-specific characteristics and knowledge. While this tren...
Mark J. Stanovich, Theodore P. Baker, An-I Andy Wa...
MASCOTS
2007
14 years 11 months ago
Reducing Hybrid Disk Write Latency with Flash-Backed I/O Requests
—One of the biggest bottlenecks in desktop-based computing is the hard disk with I/O write latency being a key contributor. I/O write latency stems from the mechanical nature of ...
Timothy Bisson, Scott A. Brandt
COMAD
2009
14 years 10 months ago
Consistency of Databases on Commodity Disk Drives
Most database systems use ARIES-like logging and recovery scheme to recover from failures and guarantee transactional consistency. ARIES relies on the Write-Ahead Logging (WAL) pr...
Robin Dhamankar, Hanuma Kodavalla, Vishal Kathuria
WG
2007
Springer
15 years 3 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...