10997 search results - page 123 / 2200 » On the Structure of Complete Sets |
178
click to vote
APN
2010
Springer
15 years 6 months ago
2010
Springer
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing p...
162
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
157
click to vote
ENTCS
2007
15 years 6 months ago
2007
In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we mo...
155
click to vote
ISMB
1993
15 years 7 months ago
1993
Algorithmsbasedonprobability theorycanaddressissues of uncertainty directly throughtheir representational frameworkandtheir theoryfor data combination.In this paper, wediscuss the...
151
click to vote
ICLP
2004
Springer
15 years 11 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...