1279 search results - page 181 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
122
Voted
ENC
2005
IEEE
15 years 7 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...
143
Voted
TASE
2011
IEEE
14 years 5 months 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...
109
click to vote
LATIN
2010
Springer
15 years 6 days 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...
121
click to vote
ICCAD
2009
IEEE
14 years 11 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...
110
click to vote
EDBT
2004
ACM
16 years 1 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...