2976 search results - page 220 / 596 » On the bounded integer programming |
331
click to vote
CC
2011
Springer
14 years 10 months ago
2011
Springer
For decades, the design and implementation of arrays in programming languages has reflected a natural tension between productivity and performance. Recently introduced HPCS langua...
173
click to vote
ICALP
2005
Springer
16 years 15 hour ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
211
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
155
click to vote
WDAG
1990
Springer
15 years 10 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
169
click to vote
PODC
2005
ACM
16 years 1 days ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...