9176 search results - page 1508 / 1836 » algorithms 2010 |
154
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
It is well known that there is a sharp density threshold for a random r-SAT formula to be satisfiable, and a similar, smaller, threshold for it to be satisfied by the pure literal ...
151
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
166
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
187
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A real world challenging task of the web master of an organization is to match the needs of user and keep their attention in their web site. So, only option is to capture the intu...
224
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we address the problem of creating believable agents (virtual characters) in video games. We consider only one meaning of believability, "giving the feeling of...