Sciweavers

1568 search results - page 18 / 314
» The problem of examination questions in algorithmics
Sort
View
HEURISTICS
2002
81views more  HEURISTICS 2002»
14 years 9 months ago
Heuristics for the Phylogeny Problem
In view of the strong increasing number of phylogeny problems and instances, the assessment of the respective optimization algorithms has become harder too. This paper contributes ...
Alexandre A. Andreatta, Celso C. Ribeiro
ICPP
1993
IEEE
15 years 2 months ago
Solving the Region Growing Problem on the Connection Machine
Abstract { This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach. The algorithm was implemented on the CM-2 and the ...
Nawal Copty, Sanjay Ranka, Geoffrey Fox, Ravi V. S...
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
14 years 10 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
COR
2008
160views more  COR 2008»
14 years 8 months ago
Formulations and exact algorithms for the vehicle routing problem with time windows
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
Brian Kallehauge
BIRTHDAY
2008
Springer
14 years 11 months ago
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
Alexander Rabinovich, Amit Shomrat