Sciweavers

658 search results - page 35 / 132
» Lower bounds for sorting networks
Sort
View
UAI
2003
13 years 9 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
ATAL
2008
Springer
13 years 9 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
COCOON
2008
Springer
13 years 9 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
MDM
2004
Springer
130views Communications» more  MDM 2004»
14 years 1 months ago
Opportunistic Resource Exchange in Inter-Vehicle Ad-Hoc Networks
In this paper we examine resource discovery in inter-vehicle ad-hoc networks in an urban area, where moving vehicles communicate with each other via short-range wireless transmiss...
Bo Xu, Aris M. Ouksel, Ouri Wolfson
INFOCOM
1992
IEEE
13 years 11 months ago
Topological Design of Interconnected LAN-MAN Networks
This paper describes a methodology for designing interconnected LAN-MAN networks with the objective of minimizing the average network delay. We consider IEEE 802.3-5 LANs intercon...
Cem Ersoy, Shivendra S. Panwar