2924 search results - page 99 / 585 » Lower Bounds in Distributed Computing |
105
Voted
MP
2006
15 years 16 days ago
2006
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
110
Voted
FUIN
2010
14 years 10 months ago
2010
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
106
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
129
Voted
COLT
2008
Springer
15 years 2 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
166
Voted
WCNC
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—In this paper, we propose an output-threshold multiple relay selection scheme for dual-hop multi-branch cooperative wireless networks. The proposed scheme selects the ï¬...