1662 search results - page 99 / 333 » The Computational Complexity of Agent Design Problems |
122
Voted
PODC
2009
ACM
15 years 7 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
130
click to vote
CAD
2006
Springer
2006
Springer
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
15 years 3 months ago
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
115
click to vote
WLP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
118
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we study a service procurement problem with uncertainty as to whether service providers are capable of completing a given task within a specified deadline. This typ...
159
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...