Sciweavers

406 search results - page 36 / 82
» Boosting Using Branching Programs
Sort
View
SC
2003
ACM
15 years 5 months ago
ParADE: An OpenMP Programming Environment for SMP Cluster Systems
Demand for programming environments to exploit clusters of symmetric multiprocessors (SMPs) is increasing. In this paper, we present a new programming environment, called ParADE, ...
Yang-Suk Kee, Jin-Soo Kim, Soonhoi Ha
HPCA
2008
IEEE
16 years 25 days ago
Branch-mispredict level parallelism (BLP) for control independence
A microprocessor's performance is fundamentally limited by the rate at which it can resolve branch mispredictions. Control independence (CI) architectures look for useful con...
Kshitiz Malik, Mayank Agarwal, Sam S. Stone, Kevin...
ICTAI
2010
IEEE
14 years 10 months ago
Combining Mixed Integer Programming and Supervised Learning for Fast Re-planning
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
Emmanuel Rachelson, Ala Ben Abbes, Sebastien Dieme...
100
Voted
CVPR
2010
IEEE
15 years 7 months ago
Highly Accurate Boundary Detection and Grouping
In this work we address boundary detection and boundary grouping. We first pursue a learning-based approach to boundary detection. For this (i) we leverage appearance and context...
Iasonas Kokkinos
TEC
2008
139views more  TEC 2008»
15 years 11 days ago
Genetic Programming Approaches for Solving Elliptic Partial Differential Equations
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
Andras Sobester, Prasanth B. Nair, Andy J. Keane