497 search results - page 63 / 100 » Approximating max-min linear programs with local algorithms |
WEA
2007
Springer
15 years 3 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
SPIN
2004
Springer
15 years 3 months ago
2004
Springer
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
WEA
2005
Springer
15 years 3 months ago
2005
Springer
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design e...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
ASPLOS
1994
ACM
15 years 1 months ago
1994
ACM
Several researchers have proposed algorithms for basic block reordering. We call these branch alignment algorithms. The primary emphasis of these algorithms has been on improving ...