Sciweavers

4103 search results - page 55 / 821
» Some results on the Collatz problem
Sort
View
LATIN
2010
Springer
15 years 3 months ago
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
EOR
2007
103views more  EOR 2007»
14 years 11 months ago
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
Consider a single machine and a set of   jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao
CAS
2008
68views more  CAS 2008»
14 years 12 months ago
Very Strongly Constrained Problems: an Ant Colony Optimization Approach
: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...
Vittorio Maniezzo, Matteo Roffilli
IPPS
2009
IEEE
15 years 6 months ago
New sequential and parallel algorithm for Dynamic Resource Constrained Project Scheduling Problem
This paper proposes a new Evolutionary Algorithm for the Dynamic Resource Constrained Project Scheduling Problem. This algorithm has new features that get around some problems lik...
André Renato Villela da Silva, Luiz Satoru ...
CEC
2008
IEEE
15 years 6 months ago
Analysis of population-based evolutionary algorithms for the vertex cover problem
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
Pietro Simone Oliveto, Jun He, Xin Yao