3495 search results - page 345 / 699 » On the random satisfiable process |
180
click to vote
IVA
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. Background characters in virtual environments do not require the same amount of processing that is usually required by main characters, however we still want simulation t...
174
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We introduce a mathematical framework for black-box software testing of functional correctness, based on concepts from stochastic process theory. This framework supports ...
175
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
149
click to vote
NAACL
2007
15 years 8 months ago
2007
This paper explores what kind of user simulation model is suitable for developing a training corpus for using Markov Decision Processes (MDPs) to automatically learn dialog strate...
172
click to vote
ICONIP
1998
15 years 8 months ago
1998
Despite all the progress in neural networks the technology is still brittle and sometimes difficult to apply. Automatic construction of networks and proper initialization of their...