Sciweavers

6568 search results - page 275 / 1314
» Reducing the Complexity of Reductions
Sort
View
WINE
2007
Springer
171views Economy» more  WINE 2007»
16 years 26 days ago
Characterizing Truthful Market Design
This paper characterizes the family of truthful doublesided auctions. Despite the importance of double-sided auctions to market design, to date no characterization of truthful dou...
Mira Gonen, Rica Gonen, Elan Pavlov
JSAC
2008
110views more  JSAC 2008»
15 years 6 months ago
Low complexity resource allocation with opportunistic feedback over downlink OFDMA networks
Abstract--Optimal tone allocation in downlink OFDMA networks is a non-convex NP-hard problem that requires extensive feedback for channel information. In this paper, two constantco...
Rajiv Agarwal, Vinay R. Majjigi, Zhu Han, Rath Van...
ASPDAC
2004
ACM
97views Hardware» more  ASPDAC 2004»
16 years 5 days ago
Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
Weiping Shi, Zhuo Li, Charles J. Alpert
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
15 years 10 months ago
The Instance Complexity Conjecture
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
Martin Kummer
CAE
2007
15 years 9 months ago
Conceptualizing Birkhoff's Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexity
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
Jaume Rigau, Miquel Feixas, Mateu Sbert