2370 search results - page 351 / 474 » The Characterization of Data-Accumulating Algorithms |
142
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together w...
165
click to vote
COLT
2005
Springer
15 years 12 months ago
2005
Springer
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
214
click to vote
FPL
2005
Springer
15 years 12 months ago
2005
Springer
With the onset of Gigabit networks, current generation networking components will soon be insufficient for numerous reasons: most notably because existing methods cannot support h...
153
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
We hypothesize that the relationship between parameter settings, speci cally parameters controlling mutation, and performance is non-linear in genetic programs. Genetic programmin...
177
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...