CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We prove that optimal strategies exist in perfect-information stochastic games with finitely many states and actions and tail winning conditions.
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Information-driven networks include a large category of networking systems, where network nodes are aware of information delivered and thus can not only forward data packets but m...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Altenbernd, Thomas and W
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Classic algorithms for sequential pattern discovery, return all frequent sequences present in a database. Since, in general, only a few ones are interesting from a user's poin...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We revisit the problem of (1
CORR
2008
Springer
13 years 8 months ago
2008
Springer
