Sciweavers

584 search results - page 20 / 117
» Efficient mass decomposition
Sort
View
CP
2006
Springer
14 years 18 days ago
An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
FATES
2006
Springer
14 years 16 days ago
Decompositional Algorithms for Safety Verification and Testing of Aspect-Oriented Systems
To efficiently solve safety verification and testing problems for an aspect-oriented system, we use multitape automata to model aspects and propose algorithms for the aspect-orient...
Cheng Li, Zhe Dang
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
14 years 6 days 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
IIWAS
2004
13 years 10 months ago
Decomposition and Reuse of Mobile Services
: Today, the development of new mobile services is associated with high costs and risks. The main aim of our research is to make this development process faster and more efficient ...
Elisabeth Dörr, Werner Winiwarter
CLIMA
2004
13 years 10 months ago
Distributed Algorithms for Dynamic Survivability of Multiagent Systems
Though multiagent systems (MASs) are being increasingly used, few methods exist to ensure survivability of MASs. All existing methods suffer from two flaws. First, a centralized su...
V. S. Subrahmanian, Sarit Kraus, Yingqian Zhang