1399 search results - page 116 / 280 » New Algorithms for k-Center and Extensions |
FUN
2007
Springer
14 years 3 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
GLOBECOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— Anycast routing is very useful for many applications such as resource discovery in Delay Tolerant Networks (DTNs). In this paper, based on a new DTN model, we first analyze th...
IEEEARES
2006
IEEE
14 years 3 months ago
2006
IEEE
A hybrid Bayesian Network (BN) is one that incorporates both discrete and continuous nodes. In our extensive applications of BNs for system dependability assessment the models are...
SCESM
2006
ACM
14 years 3 months ago
2006
ACM
The notion of aspect is important as a systematic approach to the representation of cross-cutting concerns and the incremental additions of new functionalities to an existing syst...
AICCSA
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree tha...