5624 search results - page 232 / 1125 » On Conditional Covering Problem |
171
click to vote
EUROPAR
2007
Springer
16 years 23 days ago
2007
Springer
We investigate the problem of detecting termination of a distributed computation in an asynchronous message-passing system where processes may crash and recover. We show that it is...
179
click to vote
DM
1999
15 years 6 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
167
click to vote
COMPGEOM
2006
ACM
16 years 17 days ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
152
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
Radio network design (RND) is a fundamental problem in cellular networks for telecommunications. In these networks, the terrain must be covered by a set of base stations (or anten...
139
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
In this paper, we study the problem of learning phylogenies and hidden Markov models. We call the Markov model nonsingular if all transtion matrices have determinants bounded away...