Sciweavers

1254 search results - page 114 / 251
» Making Hard Problems Harder
Sort
View
CCS
2004
ACM
14 years 3 months ago
Comparing the expressive power of access control models
Comparing the expressive power of access control models is recognized as a fundamental problem in computer security. Such comparisons are generally based on simulations between di...
Mahesh V. Tripunitara, Ninghui Li
CICLING
2003
Springer
14 years 3 months ago
An Evaluation of a Lexicographer's Workbench Incorporating Word Sense Disambiguation
NLPsystem developers and corpus lexicographers would both bene t from a tool for nding and organizing the distinctive patterns of use of words in texts. Such a tool would be an ass...
Adam Kilgarriff, Rob Koeling
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
14 years 3 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
14 years 3 months ago
Toward comparison-based adaptive operator selection
Adaptive Operator Selection (AOS) turns the impacts of the applications of variation operators into Operator Selection through a Credit Assignment mechanism. However, most Credit ...
Álvaro Fialho, Marc Schoenauer, Michè...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 3 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel