1964 search results - page 92 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
ENTCS
2007
13 years 7 months ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
EMO
2003
Springer
14 years 1 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
WIOPT
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
CVPR
2003
IEEE
14 years 10 months ago
2003
IEEE
The likelihood models used in probabilistic visual tracking applications are often complex non-linear and/or nonGaussian functions, leading to analytically intractable inference. ...