Sciweavers

1723 search results - page 145 / 345
» Cycling in linear programming problems
Sort
View
TPDS
2008
175views more  TPDS 2008»
14 years 10 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
15 years 4 months ago
A MILP-based approach to path sensitization of embedded software
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
José C. Costa, José C. Monteiro
ISMIS
1999
Springer
15 years 2 months ago
Machine Learning Method for Software Quality Model Building
Software quality prediction can be cast as a concept learning problem. In this paper, we discuss the full cycle of an application of Machine Learning to software quality predictio...
Mauricio Amaral de Almeida, Stan Matwin
ICCAD
2007
IEEE
134views Hardware» more  ICCAD 2007»
15 years 1 months ago
Efficient decoupling capacitance budgeting considering operation and process variations
This paper solves the variation-aware on-chip decoupling capacitance (decap) budgeting problem. Unlike previous work assuming the worst-case current load, we develop a novel stocha...
Yiyu Shi, Jinjun Xiong, Chunchen Liu, Lei He
MST
2007
154views more  MST 2007»
14 years 9 months ago
Crown Structures for Vertex Cover Kernelization
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...