Sciweavers

2519 search results - page 111 / 504
» cost 2007
Sort
View
ICPADS
2007
IEEE
16 years 21 days ago
Loop recreation for thread-level speculation
For some sequential loops, existing techniques that form speculative threads only at their loop boundaries do not adequately expose the speculative parallelism inherent in them. T...
Lin Gao 0002, Lian Li 0002, Jingling Xue, Tin-Fook...
NOCS
2007
IEEE
16 years 19 days ago
NoC-Based FPGA: Architecture and Routing
We present a novel network-on-chip-based architecture for future programmable chips (FPGAs). A key challenge for FPGA design is supporting numerous highly variable design instance...
Roman Gindin, Israel Cidon, Idit Keidar
CCS
2007
ACM
16 years 17 days ago
Optimal security hardening using multi-objective optimization on attack tree models of networks
Researchers have previously looked into the problem of determining if a given set of security hardening measures can effectively make a networked system secure. Many of them also...
Rinku Dewri, Nayot Poolsappasit, Indrajit Ray, Dar...
ESA
2007
Springer
130views Algorithms» more  ESA 2007»
16 years 16 days ago
Convex Combinations of Single Source Unsplittable Flows
In the single source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given digraph. The deman...
Maren Martens, Fernanda Salazar, Martin Skutella
WADS
2007
Springer
68views Algorithms» more  WADS 2007»
16 years 14 days ago
On Euclidean Vehicle Routing with Allocation
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...
Jan Remy, Reto Spöhel, Andreas Weißl