7006 search results - page 71 / 1402 » Approximation Algorithms |
EVOW
1999
Springer
15 years 4 months ago
1999
Springer
This paper describes a new approximate approach for checking the correctness of the implementation of a protocol interface, comparing its lowlevel implementation with its high-leve...
ICDAR
1999
IEEE
15 years 4 months ago
1999
IEEE
Abstract
ALGORITHMICA
2005
14 years 11 months ago
2005
Abstract. We consider the problem of approximating a polygonal curve
132
click to vote
COCOON
2004
Springer
15 years 5 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
SIAMCOMP
2010
14 years 6 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...