3838 search results - page 384 / 768 » Techniques for Optimization of Net Algorithms |
174
click to vote
EVOW
2008
Springer
15 years 8 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
184
click to vote
KR
2004
Springer
16 years 4 days ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
167
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. ...
174
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper compares three common evolutionary algorithms and our modified GA, a Distributed Adaptive Genetic Algorithm (DAGA). The optimal approach is sought to adapt, in near rea...
196
click to vote
IEEEPACT
2008
IEEE
16 years 1 months ago
2008
IEEE
This work proposes and evaluates improvements to previously known algorithms for redundancy elimination. Enhanced Scalar Replacement combines two classic techniques, scalar replac...