10988 search results - page 514 / 2198 » Algorithmic Folding Complexity |
196
click to vote
IJCAI
2003
15 years 8 months ago
2003
Teamwork demands agreement among teammembers to collaborate and coordinate effectively. When a disagreement between teammates occurs (due to failures), team-members should ideally...
175
click to vote
ESA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
208
click to vote
CSC
2009
15 years 8 months ago
2009
Small-world networks have become an important model for understanding many complex phenomena in science and in sociological contexts. One tool for exploring the critical and phase...
170
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
The LETOR website contains three information retrieval datasets used as a benchmark for testing machine learning ideas for ranking. Algorithms participating in the challenge are re...
191
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...