Sciweavers

817 search results - page 57 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
DATE
2003
IEEE
79views Hardware» more  DATE 2003»
14 years 2 months ago
Time Budgeting in a Wireplanning Context
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 ...
Jurjen Westra, Dirk-Jan Jongeneel, Ralph H. J. M. ...
PATMOS
2007
Springer
14 years 2 months ago
Optimization for Real-Time Systems with Non-convex Power Versus Speed Models
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...
Ani Nahapetian, Foad Dabiri, Miodrag Potkonjak, Ma...
ICML
2009
IEEE
14 years 3 months ago
Learning linear dynamical systems without sequence information
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...
Tzu-Kuo Huang, Jeff Schneider
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
14 years 9 days ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
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)...
Sam Kwong, S. S. Chan
CORR
2006
Springer
74views Education» more  CORR 2006»
13 years 8 months ago
Scheduling Algorithms for Procrastinators
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 ...
Michael A. Bender, Raphaël Clifford, Kostas T...