5100 search results - page 626 / 1020 » The Linear Complexity of a Graph |
292
click to vote
ICSE
2009
IEEE-ACM
15 years 4 months ago
2009
IEEE-ACM
The dynamic nature of Service-Oriented Architectures challenges traditional systems management practices which tend to be static in nature. We propose a goal-oriented, agent-based...
202
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to trans...
182
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
181
click to vote
AAAI
2011
14 years 6 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
228
click to vote
EEMMAS
2007
Springer
16 years 27 days ago
2007
Springer
Complexity of near future and even nowadays applications is exponentially increasing. In order to tackle the design of such complex systems, being able to engineer self-organising ...