Sciweavers

4372 search results - page 640 / 875
» Algorithmic Theories of Everything
Sort
View
BMCBI
2010
151views more  BMCBI 2010»
15 years 6 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
COR
2008
122views more  COR 2008»
15 years 6 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
JMM2
2006
167views more  JMM2 2006»
15 years 6 months ago
Computer Vision Methods for Improved Mobile Robot State Estimation in Challenging Terrains
External perception based on vision plays a critical role in developing improved and robust localization algorithms, as well as gaining important information about the vehicle and ...
Annalisa Milella, Giulio Reina, Roland Siegwart
JSAC
2007
189views more  JSAC 2007»
15 years 6 months ago
Non-Cooperative Power Control for Wireless Ad Hoc Networks with Repeated Games
— One of the distinctive features in a wireless ad hoc network is lack of any central controller or single point of authority, in which each node/link then makes its own decision...
Chengnian Long, Qian Zhang, Bo Li, Huilong Yang, X...