Sciweavers

685 search results - page 83 / 137
» Performance of Runtime Optimization on BLAST
Sort
View
AGENTS
2001
Springer
14 years 1 months ago
Principles of intention reconsideration
We present a framework that enables a belief-desire-intention (BDI) agent to dynamically choose its intention reconsideration policy in order to perform optimally in accordance wi...
Martijn C. Schut, Michael Wooldridge
ECRTS
1999
IEEE
14 years 1 months ago
Scheduling coprocessor for enhanced least-laxity-first scheduling in hard real-time systems
Scheduling time impact on system performance increases especially when using dynamic priority algorithms, because of the enlarged computational effort at runtime. This overhead ca...
Jens Hildebrandt, Frank Golatowski, Dirk Timmerman...
FPGA
2000
ACM
128views FPGA» more  FPGA 2000»
14 years 16 days ago
Factoring large numbers with programmable hardware
The fastest known algorithms for factoring large numbers share a core sieving technique. The sieving cores find numbers that are completely factored over a prime base set raised t...
Hea Joung Kim, William H. Mangione-Smith
TIP
2008
128views more  TIP 2008»
13 years 8 months ago
Wavelet Frame Accelerated Reduced Support Vector Machines
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
Matthias Rätsch, Gerd Teschke, Sami Romdhani,...
ICS
2007
Tsinghua U.
14 years 3 months ago
Automatic nonblocking communication for partitioned global address space programs
Overlapping communication with computation is an important optimization on current cluster architectures; its importance is likely to increase as the doubling of processing power ...
Wei-Yu Chen, Dan Bonachea, Costin Iancu, Katherine...