Sciweavers

4335 search results - page 212 / 867
» Privatizing Constraint Optimization
Sort
View
114
Voted
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
15 years 7 months ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
129
Voted
DISOPT
2008
93views more  DISOPT 2008»
15 years 3 months ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Adam N. Letchford, Nicholas A. Pearson
131
Voted
ICCAD
2010
IEEE
166views Hardware» more  ICCAD 2010»
15 years 1 months ago
Low-power clock trees for CPUs
Clock networks contribute a significant fraction of dynamic power and can be a limiting factor in high-performance CPUs and SoCs. The need for multi-objective optimization over a l...
Dongjin Lee, Myung-Chul Kim, Igor L. Markov
CDC
2008
IEEE
111views Control Systems» more  CDC 2008»
15 years 5 months ago
A Hamiltonian approximation method for the reduction of controlled systems
Abstract-- This paper considers the problem of model reduction for controlled systems. The paper considers a dual/adjoint formulation of the general optimization problem to minimiz...
Siep Weiland
110
Voted
DEDS
2010
108views more  DEDS 2010»
15 years 1 months ago
Timing Control of Switched Systems with Applications to Robotic Marionettes
Abstract We present an optimal timing control formulation for the problem of controlling autonomous puppets. In particular, by appropriately timing the different movements, entire ...
Patrick Martin, Magnus Egerstedt