Sciweavers

715 search results - page 117 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
BMCBI
2010
161views more  BMCBI 2010»
13 years 8 months ago
FRASS: the web-server for RNA structural comparison
Background: The impressive increase of novel RNA structures, during the past few years, demands automated methods for structure comparison. While many algorithms handle only small...
Svetlana Kirillova, Silvio C. E. Tosatto, Oliviero...
CORR
2011
Springer
160views Education» more  CORR 2011»
13 years 3 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
BMCBI
2010
183views more  BMCBI 2010»
13 years 8 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
ICDM
2009
IEEE
111views Data Mining» more  ICDM 2009»
14 years 3 months ago
A Game Theoretical Model for Adversarial Learning
Abstract—It is now widely accepted that in many situations where classifiers are deployed, adversaries deliberately manipulate data in order to reduce the classifier’s accura...
Wei Liu, Sanjay Chawla
ICALP
2005
Springer
14 years 2 months ago
Randomized Fast Design of Short DNA Words
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
Ming-Yang Kao, Manan Sanghi, Robert T. Schweller