1969 search results - page 267 / 394 » Financial Theory 1 |
STACS
1994
Springer
14 years 2 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
COLT
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
COCO
2010
Springer
14 years 2 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
PODC
2010
ACM
14 years 2 months ago
2010
ACM
This paper introduces the distributed MAC protocol Jade. We consider a multi-hop wireless network with a single communication channel in which a powerful adversary is able to jam ...
EUROSYS
2007
ACM
14 years 2 months ago
2007
ACM
As information technology (IT) administration becomes increasingly complex, workflow technologies are gaining popularity for IT automation. Writing correct workflow programs is no...