Sciweavers

9842 search results - page 1890 / 1969
» Problem complexity
Sort
View
ECAI
2004
Springer
14 years 4 months ago
A Context-Based Model of Attention
d abstract)1 Niek Bergboer Eric Postma Jaap van den Herik Institute for Knowledge and Agent Technology, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht It is well known t...
Niek Bergboer, Eric O. Postma, H. Jaap van den Her...
EMSOFT
2004
Springer
14 years 4 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
ESOP
2004
Springer
14 years 4 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
EUROCRYPT
2004
Springer
14 years 4 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai
FLOPS
2004
Springer
14 years 4 months ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger
« Prev « First page 1890 / 1969 Last » Next »