7006 search results - page 541 / 1402 » Approximation Algorithms |
207
click to vote
ISPD
1997
ACM
15 years 11 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...
180
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
190
click to vote
AUSAI
2009
Springer
15 years 10 months ago
2009
Springer
Regressions has successfully been incorporated into memetic algorithm (MA) to build surrogate models for the objective or constraint landscape of optimization problems. This helps ...
175
click to vote
COLING
1992
15 years 7 months ago
1992
In this paper, a discrimination and robusmess oriented adaptive learning procedure is proposed to deal with the task of syntactic ambiguity resolution. Owing to the problem of ins...
194
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...