Sciweavers

1578 search results - page 308 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
SIGMETRICS
2004
ACM
118views Hardware» more  SIGMETRICS 2004»
14 years 3 months ago
A game theoretic approach to provide incentive and service differentiation in P2P networks
Traditional Peer-to-Peer (P2P) networks do not provide service differentiation and incentive for users. Consequently, users can easily access information without contributing any ...
Richard T. B. Ma, Sam C. M. Lee, John C. S. Lui, D...
JELIA
2004
Springer
14 years 3 months ago
tascpl: TAS Solver for Classical Propositional Logic
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
Manuel Ojeda-Aciego, Agustín Valverde
VMCAI
2004
Springer
14 years 3 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
CSR
2010
Springer
14 years 2 months ago
Balancing Bounded Treewidth Circuits
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
Maurice Jansen, Jayalal M. N. Sarma
POPL
1989
ACM
14 years 1 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott