792 search results - page 129 / 159 » Reading What Machines |
PASTE
1998
ACM
13 years 12 months ago
1998
ACM
The task of mappingbetween source programs and machine code, once the code has been optimizedand transformed by a compiler is often di cult. Yet there are many instances, such as ...
STACS
1997
Springer
13 years 12 months ago
1997
Springer
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
ISTCS
1993
Springer
13 years 11 months ago
1993
Springer
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
SOUPS
2010
ACM
13 years 11 months ago
2010
ACM
With the increase of automated teller machine (ATM) frauds, new authentication mechanisms are developed to overcome security problems of personal identification numbers (PIN). Th...