7773 search results - page 1314 / 1555 » On generalized Frame-Stewart numbers |
160
click to vote
SODA
1996
ACM
15 years 8 months ago
1996
ACM
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
146
click to vote
COLING
1992
15 years 7 months ago
1992
duplicate the route. The HCRC Dialogue Database [3] We hypothesise that agents who engage in task- contains 128 such dialogues; in this work we examined oriented dialogue usually t...
155
click to vote
COLING
1992
15 years 7 months ago
1992
This paper describes the syntactic rules which are applied in the Japanese speech recognition module of a speech-to-speech translation system. Japanese is considered to be a free ...
195
click to vote
DAGSTUHL
1990
15 years 7 months ago
1990
One of the principal advantages of parallelizing a rule-based system, or more generally, any A.I. system, is the ability to pursue alternate search paths concurrently. Conventiona...
166
click to vote
AIPS
2009
15 years 7 months ago
2009
We provide a theoretical analysis of planning via Petri net unfolding, a novel technique for synthesising parallel plans. Parallel plans are generally valued for their execution f...