2168 search results - page 333 / 434 » Randomized Algorithms and Complexity Theory |
136
click to vote
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
140
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
139
click to vote
KBSE
1999
IEEE
15 years 7 months ago
1999
IEEE
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
198
click to vote
FOCS
1997
IEEE
15 years 7 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
136
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
This paper introduces the distributed MAC protocol Jade. We consider a multi-hop wireless network with a single communication channel in which a powerful adversary is able to jam ...