Sciweavers

2862 search results - page 486 / 573
» Bicriteria Network Design Problems
Sort
View
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
15 years 1 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
SODA
2007
ACM
106views Algorithms» more  SODA 2007»
14 years 11 months ago
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
Ittai Abraham, Yair Bartal, Ofer Neiman
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
14 years 11 months ago
The study for transportation planning considered the inventory using hybrid genetic algorithm
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
Shinichiro Ataka, Mitsuo Gen
CORR
2010
Springer
187views Education» more  CORR 2010»
14 years 10 months ago
Learning in A Changing World: Non-Bayesian Restless Multi-Armed Bandit
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
Haoyang Liu, Keqin Liu, Qing Zhao
TCBB
2008
103views more  TCBB 2008»
14 years 10 months ago
DNA Motif Representation with Nucleotide Dependency
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
Francis Y. L. Chin, Henry C. M. Leung