Sciweavers

4126 search results - page 684 / 826
» Set based logic programming
Sort
View
ICALP
2010
Springer
15 years 2 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
ICALP
2010
Springer
15 years 2 months ago
Preprocessing of Min Ones Problems: A Dichotomy
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
Stefan Kratsch, Magnus Wahlström
TOOLS
2000
IEEE
15 years 2 months ago
More Meaningful UML Models
UML is widely used today for modelling complex systems. However, the tools support capabilities for UML is limited, partially due to its lack of precise semantics. There are some ...
Ileana Ober
TOOLS
1999
IEEE
15 years 2 months ago
Design and Evolution of Software Architecture in Practice
With special focus on software architectural issues, we report from the first two major phases of a software development project. Our experience suggests that explicit focus on so...
Michael Christensen, Christian Heide Damm, Klaus M...
ESEC
1997
Springer
15 years 2 months ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...