Sciweavers

2192 search results - page 99 / 439
» Algorithms for Challenging Motif Problems
Sort
View
CEC
2010
IEEE
13 years 9 months ago
Two-stage based ensemble optimization for large-scale global optimization
Large-scale global optimization (LSGO) is a very important and challenging task in optimization domain, which is embedded in many scientific and engineering applications. In this p...
Yu Wang, Bin Li
JMLR
2010
130views more  JMLR 2010»
13 years 3 months ago
MOA: Massive Online Analysis, a Framework for Stream Classification and Clustering
Massive Online Analysis (MOA) is a software environment for implementing algorithms and running experiments for online learning from evolving data streams. MOA is designed to deal...
Albert Bifet, Geoff Holmes, Bernhard Pfahringer, P...
NIPS
2004
13 years 9 months ago
Convergence and No-Regret in Multiagent Learning
Learning in a multiagent system is a challenging problem due to two key factors. First, if other agents are simultaneously learning then the environment is no longer stationary, t...
Michael H. Bowling
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 10 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
WABI
2005
Springer
14 years 1 months ago
Minimum Recombination Histories by Branch and Bound
Recombination plays an important role in creating genetic diversity within species, and inferring past recombination events is central to many problems in genetics. Given a set M o...
Rune B. Lyngsø, Yun S. Song, Jotun Hein