Sciweavers

989 search results - page 94 / 198
» Pebbling and Proofs of Work
Sort
View
GCC
2003
Springer
14 years 1 months ago
Toward the Composition of Semantic Web Services
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
Jinghai Rao, Xiaomeng Su
CDC
2009
IEEE
165views Control Systems» more  CDC 2009»
14 years 26 days ago
Achieving symmetric Pareto Nash equilibria using biased replicator dynamics
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
Kiran Somasundaram, John S. Baras
ICALP
2001
Springer
14 years 19 days ago
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conju...
Albert Atserias, Maria Luisa Bonet, Juan Luis Este...
SP
2000
IEEE
121views Security Privacy» more  SP 2000»
14 years 15 days ago
A Security Infrastructure for Distributed Java Applications
We describe the design and implementation of a security infrastructure for a distributed Java application. This work is inspired by SDSI/SPKI, but has a few twists of its own. We ...
Dirk Balfanz, Drew Dean, Mike Spreitzer
STOC
2000
ACM
97views Algorithms» more  STOC 2000»
14 years 15 days ago
Quantum lower bounds by quantum arguments
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
Andris Ambainis