Sciweavers

719 search results - page 90 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
ICDCS
1996
IEEE
15 years 2 months ago
Dynamic Scheduling Strategies for Shared-memory Multiprocessors
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
Babak Hamidzadeh, David J. Lilja
IWMM
2004
Springer
90views Hardware» more  IWMM 2004»
15 years 3 months ago
Automatic heap sizing: taking real memory into account
Heap size has a huge impact on the performance of garbage collected applications. A heap that barely meets the application’s needs causes excessive GC overhead, while a heap tha...
Ting Yang, Matthew Hertz, Emery D. Berger, Scott F...
RSP
1999
IEEE
128views Control Systems» more  RSP 1999»
15 years 2 months ago
3-D Floorplanning: Simulated Annealing and Greedy Placement Methods for Reconfigurable Computing Systems
The advances in the programmable hardware has lead to new architectures where the hardware can be dynamically adapted to the application to gain better performance. There are stil...
Kia Bazargan, Ryan Kastner, Majid Sarrafzadeh
WSDM
2010
ACM
197views Data Mining» more  WSDM 2010»
15 years 4 months ago
Beyond DCG: user behavior as a predictor of a successful search
Web search engines are traditionally evaluated in terms of the relevance of web pages to individual queries. However, relevance of web pages does not tell the complete picture, si...
Ahmed Hassan, Rosie Jones, Kristina Lisa Klinkner
ICASSP
2010
IEEE
14 years 10 months ago
Fixed-budget kernel recursive least-squares
We present a kernel-based recursive least-squares (KRLS) algorithm on a fixed memory budget, capable of recursively learning a nonlinear mapping and tracking changes over time. I...
Steven Van Vaerenbergh, Ignacio Santamaría,...