Sciweavers

593 search results - page 33 / 119
» An approach to benchmarking configuration complexity
Sort
View
CADE
1999
Springer
13 years 11 months ago
A PSpace Algorithm for Graded Modal Logic
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
Stephan Tobies
GLVLSI
2003
IEEE
140views VLSI» more  GLVLSI 2003»
14 years 25 days ago
Exploiting multiple functionality for nano-scale reconfigurable systems
It is likely that it will become increasingly difficult to manufacture the complex, heterogeneous logic structures that characterise current reconfigurable logic systems. As a res...
Paul Beckett
POLICY
2001
Springer
13 years 12 months ago
Policy Based SLA Management in Enterprise Networks
The Differentiated Services Architecture defines the mechanisms that are needed to offer multiple classes of services in an IP network. While this model offers significant scaling ...
Dinesh C. Verma, Mandis Beigi, Raymond B. Jennings...
DATE
2004
IEEE
154views Hardware» more  DATE 2004»
13 years 11 months ago
Fast Exploration of Parameterized Bus Architecture for Communication-Centric SoC Design
For successful SoC design, efficient and scalable communication architecture is crucial. Some bus interconnects now provide configurable structures to meet this requirement of an ...
Chulho Shin, Young-Taek Kim, Eui-Young Chung, Kyu-...
IMC
2010
ACM
13 years 5 months ago
Revisiting the case for a minimalist approach for network flow monitoring
Network management applications require accurate estimates of a wide range of flow-level traffic metrics. Given the inadequacy of current packet-sampling-based solutions, several ...
Vyas Sekar, Michael K. Reiter, Hui Zhang