7930 search results - page 1228 / 1586 » Greedy in Approximation Algorithms |
164
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...
189
Voted
CC
2008
Springer
15 years 8 months ago
2008
Springer
Over the last seven years, we have developed static-analysis methods to recover a good approximation to the variables and dynamically allocated memory objects of a stripped executa...
169
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—The high-level synthesis process allows the automatic design and implementation of digital circuits starting from a behavioral description. Evolutionary algorithms are v...
198
Voted
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
162
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...