Sciweavers

222 search results - page 12 / 45
» A GRASP-Based Algorithm for Solving DVE Partitioning Problem
Sort
View
JAL
2002
71views more  JAL 2002»
14 years 9 months ago
A primal-dual schema based approximation algorithm for the element connectivity problem
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, Dav...
INFORMS
2008
55views more  INFORMS 2008»
14 years 9 months ago
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
April K. Andreas, J. Cole Smith
RTCSA
2005
IEEE
15 years 3 months ago
Task Partitioning upon Memory-Constrained Multiprocessors
Most prior theoretical research on partitioning algorithms for real-time multiprocessor platforms has focused on ensuring that the cumulative computing requirements of the tasks a...
Nathan Fisher, James H. Anderson, Sanjoy K. Baruah
ECRTS
2004
IEEE
15 years 1 months ago
Schedulability-Driven Partitioning and Mapping for Multi-Cluster Real-Time Systems
We present an approach to partitioning and mapping for multicluster embedded systems consisting of time-triggered and eventtriggered clusters, interconnected via gateways. We have...
Paul Pop, Petru Eles, Zebo Peng, Viacheslav Izosim...
74
Voted
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
15 years 1 months ago
A clustering- and probability-based approach for time-multiplexed FPGA partitioning
Improving logic density by time-sharing, time-multiplexed FPGAs (TMFPGAs) have become an important research topic for reconfigurable computing. Due to the precedence and capacity ...
Mango Chia-Tso Chao, Guang-Ming Wu, Iris Hui-Ru Ji...