405 search results - page 17 / 81 » Random Number Selection in Self-assembly |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
JMLR
2010
13 years 2 months ago
2010
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
BMCBI
2007
13 years 7 months ago
2007
Background: False occurrences of functional motifs in protein sequences can be considered as random events due solely to the sequence composition of a proteome. Here we use a nume...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
: We consider a game played between a hider, who hides a static object in one of several possible positions in a bounded planar region, and a searcher who wishes to reach the objec...
ICWSM
2009
13 years 5 months ago
2009
The present study demonstrates how the emotional content of search terms and their eventual results affects the breadth of a users' search for information. We observed the qu...