Sciweavers

2370 search results - page 351 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
COCOON
2005
Springer
15 years 3 months ago
Min-Energy Voltage Allocation for Tree-Structured Tasks
Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together w...
Minming Li, Becky Jie Liu, Frances F. Yao
COLT
2005
Springer
15 years 3 months ago
On Spectral Learning of Mixtures of Distributions
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...
Dimitris Achlioptas, Frank McSherry
FPL
2005
Springer
119views Hardware» more  FPL 2005»
15 years 3 months ago
Real-Time Feature Extraction for High Speed Networks
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...
David Nguyen, Gokhan Memik, Seda Ogrenci Memik, Al...
GECCO
2005
Springer
142views Optimization» more  GECCO 2005»
15 years 3 months ago
Genetic programming: parametric analysis of structure altering mutation techniques
We hypothesize that the relationship between parameter settings, speci cally parameters controlling mutation, and performance is non-linear in genetic programs. Genetic programmin...
Alan Piszcz, Terence Soule
ISAAC
2005
Springer
97views Algorithms» more  ISAAC 2005»
15 years 3 months ago
A Min-Max Relation on Packing Feedback Vertex Sets
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 ...
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang