Sciweavers

14649 search results - page 371 / 2930
» Principles of problem solving
Sort
View
GECCO
2005
Springer
219views Optimization» more  GECCO 2005»
16 years 8 days ago
An evolutionary lagrangian method for the 0/1 multiple knapsack problem
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
Yourim Yoon, Yong-Hyuk Kim, Byung Ro Moon
MFCS
2005
Springer
16 years 7 days ago
Tight Approximability Results for the Maximum Solution Equation Problem over Zp
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
Fredrik Kuivinen
SAS
2005
Springer
16 years 6 days ago
Secure Information Flow as a Safety Problem
The termination insensitive secure information flow problem can be reduced to solving a safety problem via a simple program transformation. Barthe, D’Argenio, and Rezk coined th...
Tachio Terauchi, Alexander Aiken
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
16 years 3 days ago
A Statistical Model of GA Dynamics for the OneMax Problem
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
Bulent Buyukbozkirli, Erik D. Goodman
182
Voted
CAEPIA
2003
Springer
15 years 12 months ago
A New Genetic Approach for the Partitioning Problem in Distributed Virtual Environment Systems
The Partitioning problem is a key issue in the design of Distributed Virtual Environment (DVE) systems based on a server-network architecture. This problem consist of efficiently ...
Pedro Morillo, Pedro López, Juan M. Ordu&nt...