EVOW
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Overcompression is the process of post-processing compressed images to gain either further size reduction or improved quality. This is made possible by the fact that the ...
EVOW
2007
Springer
14 years 5 months ago
2007
Springer
The Steiner Tree Problem (STP) in graphs is a well-known
EVOW
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. The strategic supply chain design problem which allows capacity shifts and budget limitations can be formulated as a linear program. Since facilities are allowed to be op...
EVOW
2007
Springer
14 years 5 months ago
2007
Springer
In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive sea...
EVOW
2007
Springer
14 years 5 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
EVOW
2007
Springer
14 years 5 months ago
2007
Springer
This paper proposes a neural network based approach for solving the resource discovery problem in Peer to Peer (P2P) networks and an Adaptive Global Local Memetic Algorithm (AGLMA)...
EVOW
2007
Springer
14 years 5 months ago
2007
Springer
In recent years, there has been an increasing concern from the evolutionary computation community on dynamic optimization problems since many real-world optimization problems are t...
EVOW
2007
Springer
14 years 5 months ago
2007
Springer
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...
EVOW
2007
Springer
14 years 5 months ago
2007
Springer
We describe a novel method of evolutionary visual learning that uses generative approach for assessing learner’s ability to recognize image contents. Each learner, implemented as...
EVOW
2007
Springer
14 years 5 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...