989 search results - page 74 / 198 » Pebbling and Proofs of Work |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Direct physical human-robot interaction has become a central part in the research field of robotics today. To use the advantages of the potential for humans and robots...
ESWS
2005
Springer
14 years 1 months ago
2005
Springer
Although OWL is rather expressive, it has a very serious limitation on datatypes; i.e., it does not support customised datatypes. It has been pointed out that many potential users...
ICALP
2001
Springer
14 years 20 days ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
CSFW
1998
IEEE
13 years 11 months ago
1998
IEEE
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...