3353 search results - page 171 / 671 » Laver and set theory |
178
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
164
click to vote
PLILP
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
190
click to vote
CCR
2004
15 years 6 months ago
2004
The science of network service composition has emerged as one of the grand themes of networking research [17] as a direct result of the complexity and sophistication of emerging n...
110
click to vote
ATAL
2005
Springer
16 years 2 hour ago
2005
Springer
In multi-agent systems where sets of joint actions (JAs) are generated, metrics are needed to evaluate these sets and efficiently allocate resources for the many JAs. For the case...
191
click to vote
ACMSE
2010
ACM
15 years 1 months ago
2010
ACM
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...