Sciweavers

7092 search results - page 671 / 1419
» Parallelizing constraint programs
Sort
View
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 6 months ago
A Semidefinite Relaxation for Air Traffic Flow Scheduling
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...
Alexandre d'Aspremont, Laurent El Ghaoui
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
15 years 6 months ago
Reasoning over Networks by Symbolic Methods
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Thomas Sturm
SAC
2008
ACM
15 years 6 months ago
Slack time evaluation with RTSJ
We address in this paper the problem of jointly scheduling hard periodic tasks and soft aperiodic events using the Real-Time Specification for Java (RTSJ). We present the programm...
Damien Masson, Serge Midonnet
JDA
2010
122views more  JDA 2010»
15 years 1 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
TASLP
2010
78views more  TASLP 2010»
15 years 1 months ago
Solving Demodulation as an Optimization Problem
We introduce two new methods for the demodulation of acoustic signals by posing the problem in a convex optimization framework. This allows the parameters of the modulator and carr...
Gregory Sell, Malcolm Slaney