Sciweavers

4491 search results - page 115 / 899
» Algorithm Engineering
Sort
View
SPIRE
2005
Springer
14 years 3 months ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger
EVOW
2007
Springer
14 years 4 months ago
Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms
Abstract. This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of Integer Linear Programming (ILP) and Genetic Algori...
Napoleão Nepomuceno, Plácido Rog&eac...
GECCO
2007
Springer
132views Optimization» more  GECCO 2007»
14 years 4 months ago
The multi-objective next release problem
This paper is concerned with the Multi-Objective Next Release Problem (MONRP), a problem in search-based requirements engineering. Previous work has considered only single objecti...
Yuanyuan Zhang, Mark Harman, S. Afshin Mansouri
HIS
2008
13 years 11 months ago
Learning Spatial Grammars for Drawn Documents Using Genetic Algorithms
The problem of object recognition may be cast into a spatial grammar framework. This system comprises three novel elements: a spatial organisation of line features, an efficient t...
Simon J. Hickinbotham, Anthony G. Cohn
ICCS
2005
Springer
14 years 3 months ago
Highly Scalable Algorithms for Robust String Barcoding
: String barcoding is a recently introduced technique for genomic based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms fo...
Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoi...