817 search results - page 57 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
121
Voted
DATE
2003
IEEE
15 years 8 months ago
2003
IEEE
Wireplanning is an approach in which the timing of inputoutput paths is planned before modules are specified, synthesized or sized. If these global wires are optimally segmented ...
176
Voted
PATMOS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Until now, the great majority of research in low-power systems has assumed a convex power model. However, recently, due to the confluence of emerging technological and ar...
136
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Virtually all methods of learning dynamic systems from data start from the same basic assumption: that the learning algorithm will be provided with a sequence, or trajectory, of d...
162
Voted
GECCO
2000
Springer
15 years 7 months ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
103
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...