706 search results - page 136 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
SODA
1992
ACM
13 years 8 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
JSAC
2008
13 years 7 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
CODES
2001
IEEE
13 years 11 months ago
2001
IEEE
In this paper, we explore a hybrid global/local search optimization framework for dynamic voltage scaling in embedded multiprocessor systems. The problem is to find, for a multipr...
BMCBI
2010
13 years 7 months ago
2010
Background: This paper introduces the notion of optimizing different norms in the dual problem of support vector machines with multiple kernels. The selection of norms yields diff...