Sciweavers

2200 search results - page 338 / 440
» Bloch's Constant is Computable
Sort
View
FSTTCS
2008
Springer
15 years 7 months ago
STCON in Directed Unique-Path Graphs
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
Sampath Kannan, Sanjeev Khanna, Sudeepa Roy
GECCO
2008
Springer
174views Optimization» more  GECCO 2008»
15 years 7 months ago
Mask functions for the symbolic modeling of epistasis using genetic programming
The study of common, complex multifactorial diseases in genetic epidemiology is complicated by nonlinearity in the genotype-to-phenotype mapping relationship that is due, in part,...
Ryan J. Urbanowicz, Nate Barney, Bill C. White, Ja...
GECCO
2008
Springer
117views Optimization» more  GECCO 2008»
15 years 7 months ago
Non-monotone differential evolution
The Differential Evolution algorithm uses an elitist selection, constantly pushing the population in a strict downhill search, in an attempt to guarantee the conservation of the ...
Michael G. Epitropakis, Vassilis P. Plagianakos, M...
ICML
2010
IEEE
15 years 7 months ago
Multi-Class Pegasos on a Budget
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
Zhuang Wang, Koby Crammer, Slobodan Vucetic
ICML
2010
IEEE
15 years 7 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio