Sciweavers

2607 search results - page 298 / 522
» Complete Functional Synthesis
Sort
View
CORR
2010
Springer
168views Education» more  CORR 2010»
15 years 4 months ago
Penalty Decomposition Methods for Rank Minimization
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
Zhaosong Lu, Yong Zhang
DISOPT
2010
129views more  DISOPT 2010»
15 years 4 months ago
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
Basile Couëtoux, Laurent Gourvès, J&ea...
CCE
2007
15 years 4 months ago
A systematic approach to plant-wide control based on thermodynamics
In this work, a systematic approach to plant-wide control design is proposed. The method combines ingredients from process networks, thermodynamics and systems theory to derive ro...
Luis T. Antelo, Irene Otero-Muras, Julio R. Banga,...
IPL
2008
80views more  IPL 2008»
15 years 4 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
COMGEO
2007
ACM
15 years 4 months ago
Graph drawings with few slopes
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
Vida Dujmovic, Matthew Suderman, David R. Wood