Sciweavers

10988 search results - page 1853 / 2198
» Algorithmic Folding Complexity
Sort
View
SAC
2005
ACM
15 years 10 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
SAC
2005
ACM
15 years 10 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq
SBCCI
2005
ACM
185views VLSI» more  SBCCI 2005»
15 years 10 months ago
Automatic generation of test sets for SBST of microprocessor IP cores
Higher integration densities, smaller feature lengths, and other technology advances, as well as architectural evolution, have made microprocessor cores exceptionally complex. Cur...
Ernesto Sánchez, Matteo Sonza Reorda, Giova...
SC
2005
ACM
15 years 10 months ago
Optimized Data Loading for a Multi-Terabyte Sky Survey Repository
Advanced instruments in a variety of scientific domains are collecting massive amounts of data that must be postprocessed and organized to support research activities. Astronomers...
Y. Dora Cai, Ruth A. Aydt, Robert Brunner
SI3D
2005
ACM
15 years 10 months ago
Broad-phase collision detection using semi-adjusting BSP-trees
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
Rodrigo G. Luque, João Luiz Dihl Comba, Car...
« Prev « First page 1853 / 2198 Last » Next »