4670 search results - page 635 / 934 » Testing that distributions are close |
156
click to vote
AAAI
2000
15 years 8 months ago
2000
This paper addresses the problem of exploration and mapping of an unknown environment by multiple robots. The mapping algorithm is an on-line approach to likelihood maximization t...
165
click to vote
AAAI
1997
15 years 8 months ago
1997
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
123
click to vote
ANLP
1997
15 years 8 months ago
1997
We describe the name analysis and pronunciation component in the German version of the Bell Labs multilingual text-tospeech system. We concentrate on street names because they enc...
151
click to vote
WSC
1998
15 years 8 months ago
1998
Causality constraints of random discrete simulation make parallel and distributed processing difficult. Methods of applying reconfigurable logic to implement and accelerate simula...
145
click to vote
WSC
2000
15 years 8 months ago
2000
This paper presents a logistic algorithm that improves traffic conditions in a network-like automated material handling system (AMHS). The algorithm uses a lookahead procedure and...