Sciweavers

3941 search results - page 275 / 789
» Computational Efficiency of Batching Methods
Sort
View
EVOW
2010
Springer
15 years 7 months ago
Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
MP
2002
84views more  MP 2002»
15 years 3 months ago
A decomposition procedure based on approximate Newton directions
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
Antonio J. Conejo, Francisco J. Nogales, Francisco...
CVPR
2006
IEEE
16 years 6 months ago
On-line Boosting and Vision
Boosting has become very popular in computer vision, showing impressive performance in detection and recognition tasks. Mainly off-line training methods have been used, which impl...
Helmut Grabner, Horst Bischof
DDECS
2006
IEEE
146views Hardware» more  DDECS 2006»
15 years 7 months ago
Automatic Identification of Timing Anomalies for Cycle-Accurate Worst-Case Execution Time Analysis
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
Jochen Eisinger, Ilia Polian, Bernd Becker, Alexan...
CAISE
2006
Springer
15 years 6 months ago
Incremental Evaluation of OCL Constraints
: Integrity checking is aimed at determining whether an operation execution violates a given integrity constraint. To perform this computation efficiently, several incremental meth...
Jordi Cabot, Ernest Teniente