134 search results - page 20 / 27 » A New Tight Upper Bound on the Transposition Distance |
AAAI
2010
14 years 11 months ago
2010
The Gibbard-Satterthwaite Theorem asserts that any reasonable voting rule cannot be strategyproof. A large body of research in AI deals with circumventing this theorem via computa...
TWC
2010
14 years 4 months ago
2010
Abstract-- This paper studies a statistical distribution of instantaneous power in pulse-shaped single-carrier (SC) modulation. Such knowledge is of significant importance to estim...
103
click to vote
DAC
2004
ACM
15 years 10 months ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
ICCAD
2003
IEEE
15 years 6 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...