Sciweavers

CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
15 years 8 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
3DIC
2009
IEEE
263views Hardware» more  3DIC 2009»
15 years 8 months ago
3D optical networks-on-chip (NoC) for multiprocessor systems-on-chip (MPSoC)
Abstract— Networks-on-chip (NoC) is emerging as a key onchip communication architecture for multiprocessor systemson-chip (MPSoC). In traditional electronic NoCs, high bandwidth ...
Yaoyao Ye, Lian Duan, Jiang Xu, Jin Ouyang, Mo Kwa...
CIAC
2010
Springer
282views Algorithms» more  CIAC 2010»
15 years 8 months ago
Improved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...
DASFAA
2009
IEEE
253views Database» more  DASFAA 2009»
15 years 8 months ago
Implementing and Optimizing Fine-Granular Lock Management for XML Document Trees
Abstract. Fine-grained lock protocols with lock modes and lock granules adjusted to the various XML processing models, allow for highly concurrent transaction processing on XML tre...
Sebastian Bächle, Theo Härder, Michael P...
DALT
2009
Springer
15 years 8 months ago
Computing Utility from Weighted Description Logic Preference Formulas
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...