14158 search results - page 476 / 2832 » Generalized switch-setting problems |
275
click to vote
ISCA
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
145
click to vote
JAIR
2002
15 years 6 months ago
2002
Recent trends in planning research have led to empirical comparison becoming commonplace. The eld has started to settle into a methodology for such comparisons, which for obvious ...
167
click to vote
SIAMCOMP
2010
15 years 4 months ago
2010
Some systems interact with their environment at physically distributed interfaces, called ports, and in testing such a system it is normal to place a tester at each port. Each test...
185
click to vote
JMLR
2010
15 years 1 months ago
2010
Appropriate selection of the kernel function, which implicitly defines the feature space of an algorithm, has a crucial role in the success of kernel methods. In this paper, we co...
208
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...