Sciweavers

4865 search results - page 676 / 973
» The Complexity of Graph Connectivity
Sort
View
ADBIS
2007
Springer
125views Database» more  ADBIS 2007»
15 years 11 months ago
Towards Self-Optimization of Message Transformation Processes
The Message Transformation Model (MTM), for modeling complex message transformation processes in data centric application scenarios, provides strong capabilities for describing the...
Matthias Böhm, Dirk Habich, Uwe Wloka, Jü...
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
15 years 11 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
ACSC
2006
IEEE
15 years 11 months ago
Trust network analysis with subjective logic
Trust networks consist of transitive trust relationships between people, organisations and software agents connected through a medium for communication and interaction. By formali...
Audun Jøsang, Ross Hayward, Simon Pope
BROADNETS
2006
IEEE
15 years 11 months ago
Minimum Rejection Scheduling in All-Photonic Networks
Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but the inability to per...
Nahid Saberi, Mark Coates
GLOBECOM
2006
IEEE
15 years 11 months ago
Optimal Routing in the Worst-Case-Error Metric
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
Edwin Soedarmadji