Sciweavers

1984 search results - page 104 / 397
» The colourful feasibility problem
Sort
View
JDA
2007
98views more  JDA 2007»
13 years 10 months ago
Admission control with advance reservations in simple networks
In the admission control problem we are given a network and a set of connection requests, each of which is associated with a path, a time interval, a bandwidth requirement, and a ...
Dror Rawitz
CADE
2011
Springer
12 years 10 months ago
Cutting to the Chase Solving Linear Integer Arithmetic
Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut...
Dejan Jovanovic, Leonardo Mendonça de Moura
CEC
2009
IEEE
14 years 4 months ago
A clustering multi-objective evolutionary algorithm based on orthogonal and uniform design
Abstract— Designing efficient algorithms for difficult multiobjective optimization problems is a very challenging problem. In this paper a new clustering multi-objective evolut...
Yuping Wang, Chuangyin Dang, Hecheng Li, Lixia Han...
EOR
2008
103views more  EOR 2008»
13 years 10 months ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...
CDC
2009
IEEE
164views Control Systems» more  CDC 2009»
13 years 8 months ago
Real-time MPC - Stability through robust MPC design
Recent results have suggested that online Model Predictive Control (MPC) can be computed quickly enough to control fast sampled systems. High-speed applications impose a hard real-...
Melanie Nicole Zeilinger, Colin Neil Jones, Davide...