1347 search results - page 220 / 270 » On the Structure of the Minimum Time Function |
141
click to vote
ACL
1994
15 years 6 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
174
click to vote
AI
2010
Springer
15 years 4 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
130
click to vote
ICPADS
1998
IEEE
15 years 9 months ago
1998
IEEE
A user-defined telecooperation service (UTS) provides service elements for application-specific communication and cooperation processes as well as integrated means for the service...
158
Voted
CATA
2003
15 years 6 months ago
2003
This paper presents a basic framework for applying static task scheduling techniques to arbitrarily-structured task systems whose targeted execution environment is comprised of fi...
270
click to vote
POPL
2008
ACM
16 years 5 months ago
2008
ACM
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...