Sciweavers

49 search results - page 5 / 10
» On generalization bounds, projection profile, and margin dis...
Sort
View
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
13 years 12 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
KDD
2009
ACM
230views Data Mining» more  KDD 2009»
14 years 8 months ago
Cross domain distribution adaptation via kernel mapping
When labeled examples are limited and difficult to obtain, transfer learning employs knowledge from a source domain to improve learning accuracy in the target domain. However, the...
ErHeng Zhong, Wei Fan, Jing Peng, Kun Zhang, Jiang...
EUSFLAT
2007
152views Fuzzy Logic» more  EUSFLAT 2007»
13 years 9 months ago
The Core of Games on Distributive Lattices
Cooperative games under precedence constraints have been introduced by Faigle and Kern [1] , [4] as a generalization of classical cooperative games. An important notion in coopera...
Lijue Xie, Michel Grabisch
CEC
2007
IEEE
14 years 2 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
IADIS
2003
13 years 9 months ago
Towards a Distributed Information Architecture for Avionics Data
Avionics data at the National Aeronautics and Space Administration’s (NASA) Jet Propulsion Laboratory (JPL) consists of distributed, unmanaged, and heterogeneous information tha...
Chris Mattmann, Dana Freeborn, Daniel J. Crichton