Sciweavers

3142 search results - page 526 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
14 years 2 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
ECAI
2006
Springer
14 years 2 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
FLAIRS
2003
13 years 11 months ago
LIDS: Learning Intrusion Detection System
The detection of attacks against computer networks is becoming a harder problem to solve in the field of network security. The dexterity of the attackers, the developing technolog...
Mayukh Dass, James Cannady, Walter D. Potter
ATAL
2010
Springer
13 years 11 months ago
Cultivating desired behaviour: policy teaching via environment-dynamics tweaks
In this paper we study, for the first time explicitly, the implications of endowing an interested party (i.e. a teacher) with the ability to modify the underlying dynamics of the ...
Zinovi Rabinovich, Lachlan Dufton, Kate Larson, Ni...
MVA
2008
305views Computer Vision» more  MVA 2008»
13 years 10 months ago
A new graph cut-based multiple active contour algorithm without initial contours and seed points
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
Jong-Sung Kim, Ki-Sang Hong