6102 search results - page 558 / 1221 » Generating Optimizing Specializers |
164
Voted
GECCO
2007
Springer
16 years 12 days ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
193
click to vote
ODBIS
2007
Springer
16 years 11 days ago
2007
Springer
Supporting SPARQL queries over relational databases becomes an active topic recently. However, it has not received enough consideration when SPARQL queries include restrictions on...
145
Voted
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
156
click to vote
EMSOFT
2005
Springer
15 years 11 months ago
2005
Springer
The nature of embedded systems development places a great deal of importance on meeting strict requirements in areas such as static code size, power consumption, and execution tim...
160
click to vote
GD
2005
Springer
15 years 11 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...