Sciweavers

1380 search results - page 114 / 276
» Computing the optimal strategy to commit to
Sort
View
DAC
2005
ACM
14 years 8 months ago
Locality-conscious workload assignment for array-based computations in MPSOC architectures
While the past research discussed several advantages of multiprocessor-system-on-a-chip (MPSOC) architectures from both area utilization and design verification perspectives over ...
Feihui Li, Mahmut T. Kandemir
CLEF
2007
Springer
14 years 2 months ago
Speeding Up IDM without Degradation of Retrieval Quality
The Image Distortion Model (IDM) has shown good retrieval quality in previous runs of the medical automatic annotation task of previous ImageCLEF workshops. However, one of its li...
Michael Springmann, Heiko Schuldt
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
13 years 9 months ago
Ultra high frequency financial data
This note is best described as a ‘Research Challenge’, and concerns building an ultra high frequency (UHF) trading system. The emphasis is on addressing the problems posed by ...
Martin Victor Sewell, Wei Yan
CIG
2006
IEEE
14 years 1 months ago
Evolving Adaptive Play for the Game of Spoof Using Genetic Programming
Abstract— Many games require opponent modelling for optimal performance. The implicit learning and adaptive nature of evolutionary computation techniques offer a natural way to d...
Mark Wittkamp, Luigi Barone
ICS
2000
Tsinghua U.
13 years 11 months ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy