Sciweavers

830 search results - page 3 / 166
» Generalizing Global Constraints Based on Network Flows
Sort
View
CODES
1998
IEEE
13 years 11 months ago
A path analysis based partitioning for time constrained embedded systems
The HW/SW partitioning problem addressed in this paper is one of the key steps in the co-design flow of heterogeneous embedded systems. Generally the aim is to provide solutions t...
Luc Bianco, Michel Auguin, Guy Gogniat, Alain Pega...
ECAI
2010
Springer
13 years 7 months ago
A Network Flow Approach to Coalitional Games
In this paper we propose a novel approach to represent coalitional games, called a Coalition-Flow Network (CF-NET), that builds upon a generalization of the network flow literature...
Talal Rahwan, Tomasz P. Michalak, Madalina Croitor...
MOBIHOC
2006
ACM
14 years 7 months ago
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
Pablo Soldati, Björn Johansson, Mikael Johans...
DATE
2007
IEEE
106views Hardware» more  DATE 2007»
14 years 1 months ago
Design closure driven delay relaxation based on convex cost network flow
Design closure becomes hard to achieve at physical layout stage due to the emergence of long global interconnects. Consequently, interconnect planning needs to be integrated in hi...
Chuan Lin, Aiguo Xie, Hai Zhou
CPAIOR
2007
Springer
14 years 1 months ago
Generalizations of the Global Cardinality Constraint for Hierarchical Resources
Abstract. We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such...
Alessandro Zanarini, Gilles Pesant