1760 search results - page 114 / 352 » Connected Set Cover Problem and Its Applications |
ICAC
2005
IEEE
14 years 1 months ago
2005
IEEE
Computing systems have become so complex that the IT industry recognizes the necessity of deliberative methods to make these systems self-configuring, self-healing, selfoptimizin...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
COR
2011
13 years 3 months ago
2011
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job di...
AAAI
2010
13 years 5 months ago
2010
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...
WEA
2009
Springer
14 years 3 months ago
2009
Springer
We present a cgal-based univariate algebraic kernel, which provides certi ed real-root isolation of univariate polynomials with integer coe cients and standard functionalities such...