15033 search results - page 80 / 3007 » Complexity Theory and Algorithms |
152
Voted
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
140
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
We present and evaluate a method for estimating the relevance and calibrating the values of parameters of an evolutionary algorithm. The method provides an information theoretic m...
140
Voted
NIPS
2001
15 years 5 months ago
2001
Classical statistical learning theory studies the generalisation performance of machine learning algorithms rather indirectly. One of the main detours is that algorithms are studi...
130
Voted
ROBOCUP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
196
Voted
PODC
2011
ACM
14 years 6 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...