Sciweavers

1154 search results - page 130 / 231
» Mathematizing C concurrency
Sort
View
PODC
2009
ACM
14 years 9 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
STOC
2003
ACM
99views Algorithms» more  STOC 2003»
14 years 9 months ago
On the fractal behavior of TCP
We propose a natural, mathematically tractable model of TCP which captures both its additive-increase, multiplicative-decrease behavior and its feedback mechanism. Neither a fluid...
Anna C. Gilbert, Howard J. Karloff
ICFP
2005
ACM
14 years 9 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell
MOBIHOC
2007
ACM
14 years 8 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
GLOBECOM
2008
IEEE
14 years 3 months ago
Interference Reduction by Beamforming in Cognitive Networks
— We consider beamforming in a cognitive network with multiple primary users and secondary users sharing the same spectrum. In particular, we assume that each secondary transmitt...
Simon Yiu, Mai Vu, Vahid Tarokh