Sciweavers

2144 search results - page 274 / 429
» Exact Flow Analysis
Sort
View
SIGCOMM
2004
ACM
15 years 11 months ago
Work-conserving distributed schedulers for Terabit routers
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
Prashanth Pappu, Jonathan S. Turner, Kenneth Wong
171
Voted
ISN
1999
Springer
159views Communications» more  ISN 1999»
15 years 10 months ago
Accounting Management in a TINA-Based Service and Network Environment
The ACTS FlowThru project aims to build a management system which supports the flow of management information across organisational and technological domains by reusing components ...
Patrick Hellemans, Cliff Redmond, Koen Daenen, Dav...
178
Voted
DATE
2004
IEEE
152views Hardware» more  DATE 2004»
15 years 9 months ago
A Design Methodology for the Exploitation of High Level Communication Synthesis
In this paper we analyse some methodological concerns that have to be faced in a design flow which contains automatic synthesis phases from high-level, system descriptions. In par...
Francesco Bruschi, Massimo Bombana
CASES
2008
ACM
15 years 8 months ago
Multi-granularity sampling for simulating concurrent heterogeneous applications
Detailed or cycle-accurate/bit-accurate (CABA) simulation is a critical phase in the design flow of embedded systems. However, with increasing system complexity, full detailed sim...
Melhem Tawk, Khaled Z. Ibrahim, Smaïl Niar
134
Voted
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 6 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking