1568 search results - page 111 / 314 » The problem of examination questions in algorithmics |
131
click to vote
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...
135
click to vote
CIE
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
124
click to vote
USENIX
2000
15 years 5 months ago
2000
We examine a policy for managing modem pools that disconnects users only if not enough modems are available for other users to connect. Managing the modem pool then becomes a repl...
111
click to vote
IUI
2003
ACM
15 years 9 months ago
2003
ACM
We examine the problems with automated recommendation systems when information about user preferences is limited. We equate the problem to one of content similarity measurement an...
136
click to vote
CRV
2007
IEEE
15 years 8 months ago
2007
IEEE
We examine the problem of finding a single meeting location for a group of heterogeneous autonomous mobile robots, such that the total system cost of traveling to the rendezvous i...