Sciweavers

2128 search results - page 421 / 426
» A general characterization of indulgence
Sort
View
CORR
2002
Springer
95views Education» more  CORR 2002»
13 years 9 months ago
Unsupervised Learning of Morphology without Morphemes
The first morphological learner based upon the theory of Whole Word Morphology (Ford et al., 1997) is outlined, and preliminary evaluation results are presented. The program, Whol...
Sylvain Neuvel, Sean A. Fulop
JACM
2000
77views more  JACM 2000»
13 years 9 months ago
The fault span of crash failures
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
George Varghese, Mahesh Jayaram
JAIR
2002
95views more  JAIR 2002»
13 years 9 months ago
A Critical Assessment of Benchmark Comparison in Planning
Recent trends in planning research have led to empirical comparison becoming commonplace. The eld has started to settle into a methodology for such comparisons, which for obvious ...
Adele E. Howe, Eric Dahlman
LOGCOM
1998
178views more  LOGCOM 1998»
13 years 9 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh
SIAMCOMP
1998
102views more  SIAMCOMP 1998»
13 years 9 months ago
L-Printable Sets
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...