Sciweavers

1487 search results - page 293 / 298
» The Computational Complexity of Link Building
Sort
View
POPL
1989
ACM
13 years 11 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
ISER
1995
Springer
100views Robotics» more  ISER 1995»
13 years 11 months ago
Distributed Robotic Manipulation: Experiments in Minimalism
Minimalism pursues the following agenda: For a given robotics task, nd the minimal con guration of resources required to solve the task. Thus, minimalism attempts to reduce the re...
Karl-Friedrich Böhringer, Russell Brown, Bruc...
CCS
2008
ACM
13 years 9 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
FM
2008
Springer
152views Formal Methods» more  FM 2008»
13 years 9 months ago
Constraint Prioritization for Efficient Analysis of Declarative Models
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...
Engin Uzuncaova, Sarfraz Khurshid
CIDR
2003
106views Algorithms» more  CIDR 2003»
13 years 8 months ago
Speculative Query Processing
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
Neoklis Polyzotis, Yannis E. Ioannidis