Sciweavers

1461 search results - page 56 / 293
» The Cost of Cache-Oblivious Searching
Sort
View
ACIVS
2008
Springer
15 years 1 months ago
Efficient and Flexible Cluster-and-Search for CBIR
Content-Based Image Retrieval is a challenging problem both in terms of effectiveness and efficiency. In this paper, we present a flexible cluster-and-search approach that is able ...
Anderson Rocha, Jurandy Almeida, Mario A. Nascimen...
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 28 days ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
COR
2010
152views more  COR 2010»
14 years 12 months ago
Variable neighborhood search for the dial-a-ride problem
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
Sophie N. Parragh, Karl F. Doerner, Richard F. Har...
IJAIT
2010
167views more  IJAIT 2010»
14 years 10 months ago
Bee Colony Optimization with Local Search for Traveling Salesman Problem
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
Li-Pei Wong, Malcolm Yoke-Hean Low, Chin Soon Chon...
CORR
2011
Springer
189views Education» more  CORR 2011»
14 years 6 months ago
A Factorial Experiment on Scalability of Search Based Software Testing
Software testing is an expensive process, which is vital in the industry. Construction of the test-data in software testing requires the major cost and to decide which method to us...
Arash Mehrmand, Robert Feldt