7047 search results - page 1084 / 1410 » Focusing on Binding and Computation |
168
click to vote
ICCBR
1995
Springer
15 years 10 months ago
1995
Springer
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
162
click to vote
ICML
1994
IEEE
15 years 10 months ago
1994
IEEE
Many real-world domains bless us with a wealth of attributes to use for learning. This blessing is often a curse: most inductive methods generalize worse given too many attributes...
158
click to vote
TACS
1991
Springer
15 years 10 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
184
click to vote
CPAIOR
2010
Springer
15 years 10 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
163
click to vote
EVOW
2010
Springer
15 years 10 months ago
2010
Springer
A challenging problem in bioinformatics is the detection of residues that account for protein function specificity, not only in order to gain deeper insight in the nature of functi...