1884 search results - page 193 / 377 » Simple Algorithm for Simple Timed Games |
187
click to vote
LR
2011
15 years 1 months ago
2011
This paper suggests a routing method for automated guided vehicles in port terminals that uses the Q-learning technique. One of the most important issues for the efficient operati...
167
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
150
click to vote
CSR
2007
Springer
16 years 14 days ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
145
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
193
click to vote
ISAAC
2001
Springer
15 years 10 months ago
2001
Springer
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...