2126 search results - page 187 / 426 » An optimization algorithm for imprecise multi-objective prob... |
172
click to vote
TIP
1998
15 years 6 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
192
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
161
click to vote
PVLDB
2010
15 years 4 months ago
2010
Data ambiguity is inherent in applications such as data integration, location-based services, and sensor monitoring. In many situations, it is possible to “clean”, or remove, ...
204
click to vote
ISPD
1997
ACM
15 years 10 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
167
click to vote
LPAR
2005
Springer
15 years 12 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...