Sciweavers

11231 search results - page 2018 / 2247
» Digging for Data Structures
Sort
View
IFIPPACT
1994
15 years 4 months ago
Exploiting the Parallelism Exposed by Partial Evaluation
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
Rajeev J. Surati, Andrew A. Berlin
LFP
1994
129views more  LFP 1994»
15 years 4 months ago
Static Dependent Costs for Estimating Execution Time
We present the rst system for estimating and using datadependent expression execution times in a language with rst-class procedures and imperative constructs. The presence of rst-...
Brian Reistad, David K. Gifford
OSDI
1994
ACM
15 years 4 months ago
Experiences with Locking in a NUMA Multiprocessor Operating System Kernel
We describe the lockingarchitecture of a new operating system, HURRICANE, designed for large scale shared-memory multiprocessors. Many papers already describe kernel lockingtechni...
Ronald C. Unrau, Orran Krieger, Benjamin Gamsa, Mi...
145
Voted
TFCV
1994
15 years 4 months ago
Attentive Visual Motion Processing: Computations in the Log-Polar Plane
Attentive vision is characterized by selective sensing in space and time as well as selective processing with respect to a speci c task. Selection in space involves the splitting ...
Konstantinos Daniilidis
IJCAI
1989
15 years 4 months ago
Preprocessing Search Spaces for Branch and Bound Search
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...
Qiang Yang, Dana S. Nau
« Prev « First page 2018 / 2247 Last » Next »