Sciweavers

315 search results - page 15 / 63
» Improving Performance by Branch Reordering
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
Control-Flow Independence Reuse via Dynamic Vectorization
Current processors exploit out-of-order execution and branch prediction to improve instruction level parallelism. When a branch prediction is wrong, processors flush the pipeline ...
Alex Pajuelo, Antonio González, Mateo Valer...
NAACL
2007
13 years 10 months ago
Source-Language Features and Maximum Correlation Training for Machine Translation Evaluation
We propose three new features for MT evaluation: source-sentence constrained n-gram precision, source-sentence reordering metrics, and discriminative unigram precision, as well as...
Ding Liu, Daniel Gildea
AIPS
2006
13 years 10 months ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith
IEEEPACT
2005
IEEE
14 years 2 months ago
A Simple Divide-and-Conquer Approach for Neural-Class Branch Prediction
The continual demand for greater performance and growing concerns about the power consumption in highperformance microprocessors make the branch predictor a critical component of ...
Gabriel H. Loh
GECCO
2004
Springer
14 years 2 months ago
Multi-branches Genetic Programming as a Tool for Function Approximation
This work presents a performance analysis of a Multi-Branches Genetic Programming (MBGP) approach applied in symbolic regression (e.g. function approximation) problems. Genetic Pro...
Katya Rodríguez-Vázquez, Carlos Oliv...