7773 search results - page 77 / 1555 » On generalized Frame-Stewart numbers |
CEC
2007
IEEE
13 years 12 months ago
2007
IEEE
— Computational complexity is a major challenge in evolutionary algorithms due to their need for repeated fitness function evaluations. Here, we aim to reduce number of fitness f...
AAAI
1990
13 years 11 months ago
1990
This paper presents an efficient and homogeneous paradigm for automatic acquisition and recognition of nonparametric shapes. Acquisition time varies from linear to cubic in the nu...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
APPROX
2008
Springer
14 years 2 days ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...