Sciweavers

1380 search results - page 154 / 276
» Computing the optimal strategy to commit to
Sort
View
ENTCS
2008
150views more  ENTCS 2008»
13 years 8 months ago
Analyzing Security Scenarios Using Defence Trees and Answer Set Programming
Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures that are able to st...
Stefano Bistarelli, Pamela Peretti, Irina Trubitsy...
PR
2010
156views more  PR 2010»
13 years 6 months ago
The hyperbolic smoothing clustering method
It is considered the minimum sum-of-squares clustering problem. The mathematical modeling of this problem leads to a min − sum − min formulation which, in addition to its intr...
Adilson Elias Xavier
ICPR
2008
IEEE
14 years 2 months ago
Layered shape matching and registration: Stochastic sampling with hierarchical graph representation
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
Xiaobai Liu, Liang Lin, Hongwei Li, Hai Jin, Wenbi...
GECCO
2009
Springer
135views Optimization» more  GECCO 2009»
14 years 2 months ago
Neuroevolutionary reinforcement learning for generalized helicopter control
Helicopter hovering is an important challenge problem in the field of reinforcement learning. This paper considers several neuroevolutionary approaches to discovering robust cont...
Rogier Koppejan, Shimon Whiteson
ICPADS
2007
IEEE
14 years 2 months ago
Scheduling multiple divisible loads on a linear processor network
Min, Veeravalli, and Barlas have recently proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one...
Matthieu Gallet, Yves Robert, Frédér...