Sciweavers

3192 search results - page 325 / 639
» The minimum latency problem
Sort
View
MFCS
2005
Springer
15 years 10 months ago
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for ...
Minming Li, Frances F. Yao
OOPSLA
2005
Springer
15 years 10 months ago
Inferring context-free grammars for domain-specific languages
Grammatical inference (or grammar inference) has been applied to various problems in areas such as computational biology, and speech and pattern recognition but its application to...
Faizan Javed
FATES
2004
Springer
15 years 10 months ago
Using Model Checking for Reducing the Cost of Test Generation
This paper presents a method for reducing the cost of test generation. A spanning set for a coverage criterion is a set of entities such that exercising every entity in the spannin...
Hyoung Seok Hong, Hasan Ural
158
Voted
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
15 years 10 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom
INFOCOM
2003
IEEE
15 years 10 months ago
Distributed Network Monitoring with Bounded Link Utilization in IP Networks
— Designing optimal measurement infrastructure is a key step for network management. In this work we address the problem of optimizing a scalable distributed polling system. The ...
Erran L. Li, Marina Thottan, Bin Yao, Sanjoy Paul