1933 search results - page 343 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
150
Voted
SOSP
2009
ACM
16 years 13 days ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
108
Voted
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
103
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
131
Voted
AI
2000
Springer
15 years 3 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
134
Voted
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
— This paper addresses the problem of classifying places in the environment of a mobile robot into semantic categories. We believe that semantic information about the type of pla...