Sciweavers

2612 search results - page 311 / 523
» Switching Graphs and Their Complexity
Sort
View
158
Voted
CASES
2006
ACM
15 years 8 months ago
Power efficient branch prediction through early identification of branch addresses
Ever increasing performance requirements have elevated deeply pipelined architectures to a standard even in the embedded processor domain, requiring the incorporation of dynamic b...
Chengmo Yang, Alex Orailoglu
CCGRID
2006
IEEE
15 years 8 months ago
DIMVisual: Data Integration Model for Visualization of Parallel Programs Behavior
Abstract-- The development of high performance parallel applications for clusters is considered a complex task. This can happen because the influence of the execution environment a...
Lucas Mello Schnorr, Philippe Olivier Alexandre Na...
135
Voted
DAC
1995
ACM
15 years 8 months ago
Orthogonal Greedy Coupling - A New Optimization Approach to 2-D FPGA Routing
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
Yu-Liang Wu, Malgorzata Marek-Sadowska
WSC
2007
15 years 7 months ago
A hybrid epidemic model: combining the advantages of agent-based and equation-based approaches
Agent-based models (ABMs) are powerful in describing structured epidemiological processes involving human behavior and local interaction. The joint behavior of the agents can be v...
Georgiy V. Bobashev, D. Michael Goedecke, Feng Yu,...
SIMUTOOLS
2008
15 years 6 months ago
An overview of the OMNeT++ simulation environment
The OMNeT++ discrete event simulation environment has been publicly available since 1997. It has been created with the simulation of communication networks, multiprocessors and ot...
András Varga, Rudolf Hornig