Sciweavers

975 search results - page 1 / 195
» Locality Optimization for Program Instances
Sort
View
IPPS
1998
IEEE
13 years 9 months ago
Locality Optimization for Program Instances
Abstract. The degree of locality of a program re ects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs ...
Claudia Leopold
IPPS
1999
IEEE
13 years 9 months ago
Regularity Considerations in Instance-Based Locality Optimization
Instance based locality optimization 6 is a semi automatic program restructuring method that reduces the number of cache misses. The method imitates the human approach of consideri...
Claudia Leopold
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
13 years 8 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
ICRA
1993
IEEE
118views Robotics» more  ICRA 1993»
13 years 9 months ago
Hip Implant Insertability Analysis: A Medical Instance of the Peg-In-Hole Problem
cavity Recent advan.cesin cementless hip replacement surgery have significantly improved the accuracy of bone cavity preparation and custom implant shape design. With the increased...
Leo Joskowicz, Russell H. Taylor
CONSTRAINTS
2008
138views more  CONSTRAINTS 2008»
13 years 5 months ago
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Martin C. Cooper