Sciweavers

1888 search results - page 253 / 378
» Proof theory and computational analysis
Sort
View
99
Voted
CCS
2010
ACM
15 years 8 months ago
Toward practical authorization-dependent user obligation systems
Many authorization system models include some notion of obligation. Little attention has been given to user obligations that depend on and affect authorizations. However, to be u...
Murillo Pontual, Omar Chowdhury, William H. Winsbo...
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
15 years 8 months ago
Three interconnected parameters for genetic algorithms
When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
Pedro A. Diaz-Gomez, Dean F. Hougen
117
Voted
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
15 years 8 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
113
Voted
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
15 years 8 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
MMSEC
2006
ACM
148views Multimedia» more  MMSEC 2006»
15 years 7 months ago
Minimizing the embedding impact in steganography
In this paper, we study the trade-off in steganography between the number of embedding changes and their amplitude. We assume that each element of the cover image is assigned a sc...
Jessica J. Fridrich