Sciweavers

6740 search results - page 1328 / 1348
» Using Classification as a Programming Language
Sort
View
CP
2004
Springer
15 years 3 months ago
Generating Robust Partial Order Schedules
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A...
EGH
2004
Springer
15 years 3 months ago
Mio: fast multipass partitioning via priority-based instruction scheduling
Real-time graphics hardware continues to offer improved resources for programmable vertex and fragment shaders. However, shader programmers continue to write shaders that require ...
Andrew Riffel, Aaron E. Lefohn, Kiril Vidimce, Mar...
ICALP
2004
Springer
15 years 3 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
IFIP
2004
Springer
15 years 3 months ago
PolyA: True Type Polymorphism for Mobile Ambients
Previous type systems for mobility calculi (the original Mobile Ambients, its variants and descendants, e.g., Boxed Ambients and Safe Ambients, and other related systems) offer lit...
Torben Amtoft, Henning Makholm, J. B. Wells
76
Voted
OOPSLA
2004
Springer
15 years 3 months ago
MC2: high-performance garbage collection for memory-constrained environments
Java is becoming an important platform for memory-constrained consumer devices such as PDAs and cellular phones, because it provides safety and portability. Since Java uses garbag...
Narendran Sachindran, J. Eliot B. Moss, Emery D. B...
« Prev « First page 1328 / 1348 Last » Next »