982 search results - page 159 / 197 » Solving Steiner tree problems in graphs to optimality |
121
click to vote
ISSS
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
77
Voted
DAC
2002
ACM
16 years 1 months ago
2002
ACM
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
98
Voted
ISCAPDCS
2007
15 years 1 months ago
2007
We address distributed real-time applications represented by systems of non-preemptive dependent periodic tasks. This system is described by an acyclic directed graph. Because the...
116
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
—Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment an...
106
Voted
ATMOS
2007
15 years 2 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...