811 search results - page 145 / 163 » An efficient algorithm for the configuration problem of domi... |
ICCAD
1999
IEEE
14 years 1 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
MOBIHOC
2009
ACM
14 years 9 months ago
2009
ACM
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
STOC
1996
ACM
14 years 28 days ago
1996
ACM
Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
FUN
2010
Springer
14 years 3 days ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...