Sciweavers

957 search results - page 120 / 192
» Addition Chain Heuristics
Sort
View
AI
2008
Springer
15 years 20 hour ago
A study of mechanisms for improving robotic group performance
Many collaborative multi-robot application domains have limited areas of operation that cause spatial conflicts between robotic teammates. These spatial conflicts can cause the te...
Avi Rosenfeld, Gal A. Kaminka, Sarit Kraus, Onn Sh...
BMCBI
2007
160views more  BMCBI 2007»
15 years 7 hour ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...
JACM
2006
99views more  JACM 2006»
14 years 12 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
CIKM
2010
Springer
14 years 10 months ago
Ranking related entities: components and analyses
Related entity finding is the task of returning a ranked list of homepages of relevant entities of a specified type that need to engage in a given relationship with a given sour...
Marc Bron, Krisztian Balog, Maarten de Rijke
GIS
2010
ACM
14 years 10 months ago
Location disambiguation in local searches using gradient boosted decision trees
Local search is a specialization of the web search that allows users to submit geographically constrained queries. However, one of the challenges for local search engines is to un...
Ritesh Agrawal, James G. Shanahan