1632 search results - page 181 / 327 » Sublinear Time Algorithms for Metric Space Problems |
185
click to vote
RSP
1998
IEEE
15 years 8 months ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
141
click to vote
FORMATS
2006
Springer
15 years 8 months ago
2006
Springer
This paper argues that basing the semantics of concurrent systems on the notions of state and state transitions is neither advisable nor necessary. The tendency to do this is deepl...
127
click to vote
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
This paper reports about the application of a new variant of multiobjective Mixed-Integer Evolution Strategy to a warehouse design optimization problem. The algorithm is able to d...
127
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
126
click to vote
DCG
1998
15 years 4 months ago
1998
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...