Sciweavers

2612 search results - page 100 / 523
» Switching Graphs and Their Complexity
Sort
View
APSEC
2005
IEEE
15 years 3 months ago
Architectural Style - Based Modeling and Simulation of Complex Software Systems
The design and development of complex software systems is a difficult task, and it is not easy to ensure the quality of a developed software. The paper presents an architectural ...
Ping Guo, Gregor Engels, Reiko Heckel
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 4 months ago
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
Georg Moser, Andreas Schnabl
BPM
2006
Springer
206views Business» more  BPM 2006»
15 years 1 months ago
A Discourse on Complexity of Process Models
Complexity has undesirable effects on, among others, the correctness, maintainability, and understandability of business process models. Yet, measuring complexity of business proce...
Jorge Cardoso, Jan Mendling, Gustaf Neumann, Hajo ...
STACS
2001
Springer
15 years 2 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
ACID
2006
220views Algorithms» more  ACID 2006»
14 years 11 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove