Sciweavers

505 search results - page 17 / 101
» On the Minimality and Decomposability of Constraint Networks
Sort
View
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
14 years 20 days ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
CDC
2010
IEEE
182views Control Systems» more  CDC 2010»
13 years 3 months ago
An approximate dual subgradient algorithm for multi-agent non-convex optimization
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
Minghui Zhu, Sonia Martínez
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 6 days ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert
DAC
2004
ACM
14 years 9 months ago
Memory access scheduling and binding considering energy minimization in multi-bank memory systems
Memory-related activity is one of the major sources of energy consumption in embedded systems. Many types of memories used in embedded systems allow multiple operating modes (e.g....
Chun-Gi Lyuh, Taewhan Kim
ICASSP
2011
IEEE
13 years 5 days ago
Fast algorithm for beamforming problems in distributed communication of relay networks
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
Cong Sun, Yaxiang Yuan