Sciweavers

90 search results - page 3 / 18
» A General Scheme for Multiple Lower Bound Computation in Con...
Sort
View
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 6 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
ICALP
2005
Springer
13 years 11 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
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...
Roberto Tamassia, Nikos Triandopoulos
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
13 years 7 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
EWSN
2007
Springer
14 years 5 months ago
Efficient Routing from Multiple Sources to Multiple Sinks in Wireless Sensor Networks
Initial deployments of wireless sensor networks (WSNs) were based on a many-to-one communication paradigm, where a single sink collects data from a number of data sources. Recently...
Pietro Ciciriello, Luca Mottola, Gian Pietro Picco
CPAIOR
2010
Springer
13 years 10 months ago
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...
Timo Berthold, Stefan Heinz, Marco E. Lübbeck...