Sciweavers

2214 search results - page 150 / 443
» Complexity of Reasoning
Sort
View
116
Voted
WSC
2001
15 years 4 months ago
Deterministic fluid models of congestion control in high-speed networks
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
Sanjay Shakkottai, R. Srikant
106
Voted
CSL
2007
Springer
15 years 9 months ago
Propositional Logic for Circuit Classes
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
Klaus Aehlig, Arnold Beckmann
119
Voted
DATE
2003
IEEE
93views Hardware» more  DATE 2003»
15 years 8 months ago
Trade Offs in the Design of a Router with Both Guaranteed and Best-Effort Services for Networks on Chip
Managing the complexity of designing chips containing billions of transistors requires decoupling computation from communication. For the communication, scalable and compositional...
Edwin Rijpkema, Kees G. W. Goossens, Andrei Radule...
APWEB
2006
Springer
15 years 7 months ago
The Case of the Duplicate Documents Measurement, Search, and Science
Many of the documents in large text collections are duplicates and versions of each other. In recent research, we developed new methods for finding such duplicates; however, as the...
Justin Zobel, Yaniv Bernstein
132
Voted
LACL
2005
Springer
15 years 9 months ago
Linguistic Facts as Predicates over Ranges of the Sentence
Abstract. This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not li...
Benoît Sagot