Sciweavers

2924 search results - page 248 / 585
» Lower Bounds in Distributed Computing
Sort
View
MFCS
2005
Springer
15 years 9 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
ICALP
2004
Springer
15 years 9 months ago
Coordination Mechanisms
Abstract. We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and noncolluding agents. The quality of a coordination ...
George Christodoulou, Elias Koutsoupias, Akash Nan...
APCCAS
2002
IEEE
100views Hardware» more  APCCAS 2002»
15 years 9 months ago
On three-dimensional layout of pyramid networks
The pyramid networks are well-known as suitable structures for parallel computations such as image processing. This paper shows a practical 3D VLSI layout of the N-vertex pyramid ...
T. Yamada, N. Fujii, S. Ueno
RTSS
2002
IEEE
15 years 9 months ago
Dynamic Scan Scheduling
We present an approach to computing cyclic schedules online and in real time, while attempting to maximize a quality-of-service metric. The motivation is the detection of RF emitt...
Bruno Dutertre
CAISE
1999
Springer
15 years 8 months ago
Time Constraints in Workflow Systems
Time management is a critical component of workflow-based process management. Important aspects of time management include planning of workflow process execution in time, estimat...
Johann Eder, Euthimios Panagos, Michael Rabinovich