Sciweavers

1461 search results - page 54 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
CSMR
2006
IEEE
15 years 1 months ago
Search-Based Software Maintenance
The high cost of software maintenance could potentially be greatly reduced by the automatic refactoring of object-oriented programs to increase their understandability, adaptabili...
Mark Kent O'Keeffe, Mel Ó Cinnéide
EVOW
2008
Springer
15 years 1 months ago
Efficient Local Search Limitation Strategies for Vehicle Routing Problems
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
Yuichi Nagata, Olli Bräysy
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
15 years 1 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix
AIPS
2009
15 years 29 days ago
Using Distance Estimates in Heuristic Search
This paper explores the use of an oft-ignored information source in heuristic search: a search-distance-to-go estimate. Operators frequently have different costs and cost-to-go is...
Jordan Tyler Thayer, Wheeler Ruml
ICML
2005
IEEE
16 years 20 days ago
Robust one-class clustering using hybrid global and local search
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
Gunjan Gupta, Joydeep Ghosh