Sciweavers

16843 search results - page 156 / 3369
» On Generalized Authorization Problems
Sort
View
116
Voted
ISICA
2007
Springer
15 years 11 months ago
A New Evolutionary Decision Theory for Many-Objective Optimization Problems
In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that ...
Zhuo Kang, Lishan Kang, Xiufen Zou, Minzhong Liu, ...
150
Voted
GECCO
2009
Springer
116views Optimization» more  GECCO 2009»
15 years 8 months ago
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
Bryant A. Julstrom
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
15 years 8 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
CHI
2006
ACM
16 years 5 months ago
The project fragmentation problem in personal information management
The project fragmentation problem in personal information management occurs when someone who is working on a single project stores and retrieves information items relating to that...
Ofer Bergman, Ruth Beyth-Marom, Rafi Nachmias
COR
2006
122views more  COR 2006»
15 years 5 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...