2778 search results - page 274 / 556 » Limit complexities revisited |
173
click to vote
SIGECOM
2005
ACM
16 years 7 days ago
2005
ACM
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
219
click to vote
UPP
2004
Springer
16 years 12 hour ago
2004
Springer
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
164
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
183
click to vote
APNOMS
2006
Springer
15 years 10 months ago
2006
Springer
Peer-to-Peer systems are based on the concept of resources localization and mutualization in dynamic context. In specific environment such as mobile networks, characterized by high...
175
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Assigning tasks to agents is complex, especially in highly dynamic environments. Typical protocol-based approaches for task assignment such as Contract Net have proven their value...