2370 search results - page 321 / 474 » The Characterization of Data-Accumulating Algorithms |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We study throughput-optimal scheduling/routing over mobile ad-hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiu...
106
click to vote
IWCIA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, we study the problem of utility maximization in Peer-to-Peer (P2P) systems, in which aggregate utilities are maximized by running distributed algorithms on P2P no...
MMSEC
2006
ACM
15 years 4 months ago
2006
ACM
The widespread use of the Internet makes software piracy and unauthorized modification easier and more frequent. Among the many techniques developed for protecting software copyr...
POPL
2004
ACM
15 years 3 months ago
2004
ACM
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...