2126 search results - page 136 / 426 » An optimization algorithm for imprecise multi-objective prob... |
186
click to vote
JAR
2011
15 years 1 months ago
2011
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
169
click to vote
ASPDAC
2004
ACM
16 years 4 days ago
2004
ACM
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
184
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
194
click to vote
CP
2009
Springer
16 years 1 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
166
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
We explore the advantages of DNA-like genomes for evolutionary computation in silico. Coupled with simulations of chemical reactions, these genomes offer greater efficiency, reliab...