10608 search results - page 590 / 2122 » Complexity of O'Hara's Algorithm |
152
click to vote
ICTAI
2005
IEEE
16 years 23 days ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
209
click to vote
CHES
2005
Springer
16 years 21 days ago
2005
Springer
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
176
click to vote
ISCIS
2005
Springer
16 years 20 days ago
2005
Springer
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
184
click to vote
WABI
2004
Springer
16 years 15 days ago
2004
Springer
Abstract. In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n 3 + m 3 + mn 2 + nm 2 + mn) where n and m are the lengths of...
192
click to vote
FUN
2010
Springer
15 years 12 months ago
2010
Springer
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...