Sciweavers

430 search results - page 72 / 86
» Constructing Dynamic Optimization Test Problems Using the Mu...
Sort
View
GECCO
2005
Springer
232views Optimization» more  GECCO 2005»
15 years 5 months ago
Factorial representations to generate arbitrary search distributions
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...
Marc Toussaint
TPDS
2010
126views more  TPDS 2010»
14 years 6 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
ALGORITHMICA
2011
14 years 6 months ago
Knowledge State Algorithms
We introduce the concept of knowledge states; many well-known algorithms can be viewed as knowledge state algorithms. The knowledge state approach can be used to to construct comp...
Wolfgang W. Bein, Lawrence L. Larmore, John Noga, ...
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 5 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
FUIN
2011
358views Cryptology» more  FUIN 2011»
14 years 3 months ago
Unsupervised and Supervised Learning Approaches Together for Microarray Analysis
In this article, a novel concept is introduced by using both unsupervised and supervised learning. For unsupervised learning, the problem of fuzzy clustering in microarray data as ...
Indrajit Saha, Ujjwal Maulik, Sanghamitra Bandyopa...