Sciweavers

3020 search results - page 187 / 604
» Optimal partition trees
Sort
View
ADC
2003
Springer
123views Database» more  ADC 2003»
15 years 11 months ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
CP
2007
Springer
16 years 22 days ago
Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario
Defence trees and CP-net (ceteris paribus network) are two useful approaches that can be used to help a system administrator to analyze a security scenario and to give him a model ...
Stefano Bistarelli, Pamela Peretti, Irina Trubitsy...
EC
2008
153views ECommerce» more  EC 2008»
15 years 6 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
ICML
2005
IEEE
16 years 7 months ago
Bayesian sparse sampling for on-line reward optimization
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
BNCOD
2003
91views Database» more  BNCOD 2003»
15 years 8 months ago
Persistent Indexing Technology for Large Sequences
There are two aspects to the work being presented here. The first is a novel persistent index structure for genomic data, a prototype of which has been completed. The second, usin...
Robert Japp