Sciweavers

4372 search results - page 369 / 875
» Algorithmic Theories of Everything
Sort
View
GECCO
2006
Springer
181views Optimization» more  GECCO 2006»
15 years 10 months ago
Robustness in cooperative coevolution
Though recent analysis of traditional cooperative coevolutionary algorithms (CCEAs) casts doubt on their suitability for static optimization tasks, our experience is that the algo...
R. Paul Wiegand, Mitchell A. Potter
NIPS
2007
15 years 8 months ago
Discriminative K-means for Clustering
We present a theoretical study on the discriminative clustering framework, recently proposed for simultaneous subspace selection via linear discriminant analysis (LDA) and cluster...
Jieping Ye, Zheng Zhao, Mingrui Wu
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 8 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
METMBS
2003
255views Mathematics» more  METMBS 2003»
15 years 8 months ago
Causal Explorer: A Causal Probabilistic Network Learning Toolkit for Biomedical Discovery
Causal Probabilistic Networks (CPNs), (a.k.a. Bayesian Networks, or Belief Networks) are well-established representations in biomedical applications such as decision support system...
Constantin F. Aliferis, Ioannis Tsamardinos, Alexa...
ATAL
2010
Springer
15 years 7 months ago
PAC-MDP learning with knowledge-based admissible models
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
Marek Grzes, Daniel Kudenko