1279 search results - page 181 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
ENC
2005
IEEE
14 years 2 months ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
TASE
2011
IEEE
13 years 18 days ago
2011
IEEE
Abstract—A fast offset surface generation approach is presented in this paper to construct intersection-free offset surfaces, which preserve sharp features, from freeform triangu...
LATIN
2010
Springer
13 years 7 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
ICCAD
2009
IEEE
13 years 6 months ago
2009
IEEE
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
EDBT
2004
ACM
14 years 9 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...