29908 search results - page 201 / 5982 » On the Complexity of |
159
click to vote
CAISE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Enterprise Architecture (EA) models provide information on the fundamental as-is structure of a company or governmental agency and thus serve as an informational basis fo...
154
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
173
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
In this article we evaluate an epidemic algorithm for the synchronization of coupled Kuramoto oscillators in complex Peer-to-Peer topologies. The algorithm requires a periodic coup...
169
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
179
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...