Sciweavers

350 search results - page 44 / 70
» Branching Programs for Tree Evaluation
Sort
View
IPCCC
1999
IEEE
13 years 12 months ago
Accurately modeling speculative instruction fetching in trace-driven simulation
Performance evaluation of modern, highly speculative, out-of-order microprocessors and the corresponding production of detailed, valid, accurate results have become serious challe...
R. Bhargava, L. K. John, F. Matus
TON
2002
125views more  TON 2002»
13 years 7 months ago
Multicast-based inference of network-internal delay distributions
Packet delay greatly influences the overall performance of network applications. It is therefore important to identify causes and location of delay performance degradation within ...
Francesco Lo Presti, Nick G. Duffield, Joseph Horo...
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
13 years 11 months ago
Robust symbolic regression with affine arithmetic
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
Cassio Pennachin, Moshe Looks, João A. de V...
DIS
2005
Springer
14 years 1 months ago
Support Vector Inductive Logic Programming
Abstract. In this paper we explore a topic which is at the intersection of two areas of Machine Learning: namely Support Vector Machines (SVMs) and Inductive Logic Programming (ILP...
Stephen Muggleton, Huma Lodhi, Ata Amini, Michael ...
DSN
2009
IEEE
14 years 2 months ago
Fitness-guided path exploration in dynamic symbolic execution
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
Tao Xie, Nikolai Tillmann, Jonathan de Halleux, Wo...