2446 search results - page 131 / 490 » Choiceless Polynomial Time |
94
Voted
STOC
2006
ACM
16 years 1 months ago
2006
ACM
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
105
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
97
Voted
LATIN
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
182
Voted
TIME
2009
IEEE
15 years 7 months ago
2009
IEEE
—Rule-based filters are sequences of rules formed of a condition and a decision. Rules are applied sequentially up to the first fulfilled condition, whose matching decision de...
99
Voted
CCGRID
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...