Sciweavers

3204 search results - page 199 / 641
» The Alcuin Number of a Graph
Sort
View
LPNMR
2005
Springer
15 years 11 months ago
Loops: Relevant or Redundant?
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...
Martin Gebser, Torsten Schaub
MFCS
2005
Springer
15 years 11 months ago
D-Width: A More Natural Measure for Directed Tree Width
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
Mohammad Ali Safari
APPROX
2004
Springer
120views Algorithms» more  APPROX 2004»
15 years 11 months ago
Simultaneous Source Location
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
Konstantin Andreev, Charles Garrod, Bruce M. Maggs...
ECBS
2002
IEEE
146views Hardware» more  ECBS 2002»
15 years 11 months ago
Top-Down Composition of Software Architectures
This paper discusses an approach for top-down composition of software architectures. First, an architecture is derived that addresses functional requirements only. This architectu...
Hans de Bruin, Hans van Vliet
IPPS
2002
IEEE
15 years 11 months ago
Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
Yu Wang 0003, Xiang-Yang Li