Sciweavers

5244 search results - page 247 / 1049
» Structural Complexity of AvgBPP
Sort
View
TON
2010
176views more  TON 2010»
14 years 11 months ago
Approximation of Generalized Processor Sharing With Interleaved Stratified Timer Wheels
This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data structure for traffic shaping and scheduling in packet-switched networks. The data structure ...
Martin Karsten
OOIS
1997
Springer
15 years 9 months ago
A Framework for Component-Oriented Tool Integration
Tool environments supporting the development of complex products need to be open and flexible. These requirements cannot be fulfilled in an adequate way by predefined coordinat...
Kai-Uwe Sattler
133
Voted
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
15 years 9 months ago
Lower Bounds for Dynamic Algorithms
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
Michael L. Fredman
ACSD
2009
IEEE
87views Hardware» more  ACSD 2009»
15 years 9 months ago
Saving Space in a Time Efficient Simulation Algorithm
A number of algorithms are available for computing the simulation relation on Kripke structures and on labelled transition systems representing concurrent systems. Among them, the...
Silvia Crafa, Francesco Ranzato, Francesco Tapparo
116
Voted
ESA
2008
Springer
127views Algorithms» more  ESA 2008»
15 years 6 months ago
The Alcuin Number of a Graph
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
Péter Csorba, Cor A. J. Hurkens, Gerhard J....