499 search results - page 49 / 100 » Constructive Induction by Analogy |
148
click to vote
ICC
2009
IEEE
15 years 3 months ago
2009
IEEE
We revisit the problem of scheduling the sources transmissions in a many-to-one flow to provide reliable communication between n sources and a single destination. The performance o...
264
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
165
click to vote
TACAS
2009
Springer
16 years 27 days ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
180
click to vote
PAKDD
2001
ACM
15 years 10 months ago
2001
ACM
Information extraction (IE) from semi-structured Web documents is a critical issue for information integration systems on the Internet. Previous work in wrapper induction aim to so...
181
click to vote
AAAI
2008
15 years 8 months ago
2008
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...