4184 search results - page 626 / 837 » Names of Our Lives |
179
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
178
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
170
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
196
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
197
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...