Sciweavers

2612 search results - page 110 / 523
» Switching Graphs and Their Complexity
Sort
View
CASCON
2006
117views Education» more  CASCON 2006»
14 years 11 months ago
Requirements-driven design of autonomic application software
Autonomic computing systems reduce software maintenance costs and management complexity by taking on the responsibility for their configuration, optimization, healing, and protect...
Alexei Lapouchnian, Yijun Yu, Sotirios Liaskos, Jo...
COMCOM
2002
104views more  COMCOM 2002»
14 years 9 months ago
Low-latency guaranteed-rate scheduling using Elastic Round Robin
Packet scheduling algorithms in switches and routers will likely play a critical role in providing the Quality-of-Service (QoS) guarantees required by many real-time multimedia ap...
Salil S. Kanhere, Harish Sethu
ISCC
1999
IEEE
15 years 2 months ago
On Network Survivability Algorithms Based on Trellis Graph Transformations
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
Soulla Louca, Andreas Pitsillides, George Samaras
RR
2010
Springer
14 years 8 months ago
Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog r...
Reinhard Pichler, Axel Polleres, Sebastian Skritek...
CIE
2008
Springer
14 years 12 months ago
Many Facets of Complexity in Logic
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
Antonina Kolokolova