Sciweavers

3 search results - page 1 / 1
» Feasibility concerns in PGM graphs with bounded buffers
Sort
View
ICECCS
1997
IEEE
105views Hardware» more  ICECCS 1997»
13 years 8 months ago
Feasibility concerns in PGM graphs with bounded buffers
Sanjoy K. Baruah, Steve Goddard, Kevin Jeffay
TC
2008
13 years 4 months ago
Throughput-Buffering Trade-Off Exploration for Cyclo-Static and Synchronous Dataflow Graphs
Multimedia applications usually have throughput constraints. An implementation must meet these constraints, while it minimizes resource usage and energy consumption. The compute in...
Sander Stuijk, Marc Geilen, Twan Basten
CPAIOR
2010
Springer
13 years 9 months ago
Solving Connected Subgraph Problems in Wildlife Conservation
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
Bistra N. Dilkina, Carla P. Gomes