Sciweavers

200 search results - page 18 / 40
» ipl 2006
Sort
View
IPL
2006
151views more  IPL 2006»
15 years 1 months ago
Approximating weighted matchings in parallel
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
Stefan Hougardy, Doratha E. Drake Vinkemeier
IPL
2006
101views more  IPL 2006»
15 years 1 months ago
An efficient approximation for the Generalized Assignment Problem
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
Reuven Cohen, Liran Katzir, Danny Raz
IPL
2006
93views more  IPL 2006»
15 years 1 months ago
A decidable characterization of the classes between lintime and exptime
A language is defined by closure under safe iteration and under a new form of safe diagonalization that, unlike other forms of diagonalization used in literature to define sub-recu...
Salvatore Caporaso
IPL
2006
74views more  IPL 2006»
15 years 1 months ago
Periodic and Sturmian languages
Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as ...
Lucian Ilie, Solomon Marcus, Ion Petre
IPL
2006
61views more  IPL 2006»
15 years 1 months ago
Fair service for mice in the presence of elephants
We show how randomized caches can be used in resource-poor partial-state routers to provide a fair share of bandwidth to short-lived flows that are known as mice when long-lived f...
Seth Voorhies, Hyunyoung Lee, Andreas Klappenecker