Sciweavers

6456 search results - page 143 / 1292
» Constraint Solving on Terms
Sort
View
CORR
2010
Springer
168views Education» more  CORR 2010»
15 years 6 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
JAIR
2007
111views more  JAIR 2007»
15 years 6 months ago
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
J. Christopher Beck, Nic Wilson
GLOBECOM
2009
IEEE
15 years 4 months ago
On the Efficiency of a Game Theoretic Approach to Sparse Regenerator Placement in WDM Networks
In this paper we provide a mathematical ILP model for the Regeneration Placement Problem (RPP) which minimizes the total number of regeneration nodes allocated in a translucent opt...
Diego Lucerna, Nicola Gatti, Guido Maier, Achille ...
JSCIC
2010
178views more  JSCIC 2010»
15 years 1 months ago
A Compact Fourth Order Scheme for the Helmholtz Equation in Polar Coordinates
In many problems, one wishes to solve the Helmholtz equation in cylindrical or spherical coordinates which introduces variable coefficients within the differentiated terms. Fourth ...
S. Britt, S. Tsynkov, Eli Turkel
EMSOFT
2004
Springer
15 years 11 months ago
An approach for integrating basic retiming and software pipelining
Basic retiming is an algorithm originally developed for hardware optimization. Software pipelining is a technique proposed to increase instruction-level parallelism for parallel p...
Noureddine Chabini, Wayne Wolf