Sciweavers

3082 search results - page 382 / 617
» New Bounds for the Controller Problem
Sort
View
199
Voted
DMIN
2010
262views Data Mining» more  DMIN 2010»
15 years 4 months ago
SMO-Style Algorithms for Learning Using Privileged Information
Recently Vapnik et al. [11, 12, 13] introduced a new learning model, called Learning Using Privileged Information (LUPI). In this model, along with standard training data, the tea...
Dmitry Pechyony, Rauf Izmailov, Akshay Vashist, Vl...
ICML
2002
IEEE
16 years 7 months ago
Active + Semi-supervised Learning = Robust Multi-View Learning
In a multi-view problem, the features of the domain can be partitioned into disjoint subsets (views) that are sufficient to learn the target concept. Semi-supervised, multi-view a...
Ion Muslea, Steven Minton, Craig A. Knoblock
182
Voted
GECCO
2007
Springer
148views Optimization» more  GECCO 2007»
16 years 24 days ago
Exploring the behavior of building blocks for multi-objective variation operator design using predator-prey dynamics
In this paper, we utilize a predator-prey model in order to identify characteristics of single-objective variation operators in the multi-objective problem domain. In detail, we a...
Christian Grimme, Joachim Lepping, Alexander Papas...
GECCO
2008
Springer
103views Optimization» more  GECCO 2008»
15 years 7 months ago
Empirical investigations on parallel competent genetic algorithms
This paper empirically investigates parallel competent genetic algorithms (cGAs) [4]. cGAs, such as BOA [21], LINCGA [15], D5 -GA [28], can solve GA-difficult problems by automati...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
ECCC
2010
143views more  ECCC 2010»
15 years 4 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran