Sciweavers

1448 search results - page 122 / 290
» Restricted Stack Implementations
Sort
View
JDA
2007
83views more  JDA 2007»
13 years 7 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
CORR
2002
Springer
144views Education» more  CORR 2002»
13 years 7 months ago
Polynomial Time Data Reduction for Dominating Set
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
Jochen Alber, Michael R. Fellows, Rolf Niedermeier
SE
2010
13 years 6 months ago
Towards an Architectural Style for Multi-tenant Software Applications
Abstract: Multi-tenant software applications serve different organizations from a single instance and help to save development, maintenance, and administration costs. The architect...
Heiko Koziolek
RTS
2010
127views more  RTS 2010»
13 years 2 months ago
Scheduling of hard real-time garbage collection
Automatic memory management or garbage collection greatly simplifies development of large systems. However, garbage collection is usually not used in real-time systems due to the u...
Martin Schoeberl
WDAG
1997
Springer
92views Algorithms» more  WDAG 1997»
13 years 12 months ago
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication
Abstract. We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with p...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg