Research Publications
All 2012 | |
| Narrow your search | 84 result(s) |
By Type
By Year By Research Group | Learning Objective and Outcome: Attendees will receive an overview of recent criticisms of forensic identification; be updated on the findings of and rationale behind recent studies of expertise in fingerprint identification; and understand the ... Partially ordered plans have several useful properties, such as exhibiting the structure of the plan more clearly which facilitates post-plan generation tasks like scheduling the plan, explaining it to a user, or breaking it into subplans for ... In simplified protein structure prediction, genetic algorithms have not been applied to 3-dimensional face-centred cubic lattice. In this paper, we present a new genetic algorithm for protein structure prediction problem using face-centred cubic lattice ... Stochastic perturbation on variable flipping is the key idea of local search for SAT. Observing that variables are flipped several times in an attempt to escape from a local minimum, this paper presents a duplication learning mechanism in stagnation ... Local Search approaches to constraint satisfaction are based on the ability to compute violation scores. These estimate ’how far’ a given assignment is from satisfying the constraints, and aim at guiding the search towards assignments whose violation will... We study propagation of a global constraint that ensures that each row of a matrix of decision variables satisfies a Regular constraint, and each column satisfies a Gcc constraint. On the negative side, we prove that propagation is NP-hard even under some... This paper introduces multi-directional local search, a metaheuristic for multi-objective op- timization. We first motivate the method and present an algorithmic framework for it. We then apply it to several known multi-objective problems such as the ... When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear constraints both with unit and non-unit coefficients? Constraint variants are ubiquitous: ... We study the computational complexity of optimal bribery and manipulation schemes for sports tournaments with uncertain information: cup; challenge or caterpillar; and round robin. Our results carry over to the equivalent voting rules: sequential ... |