Sciweavers

1291 search results - page 98 / 259
» Arithmetic program paths
Sort
View
90
Voted
ICTAI
2005
IEEE
15 years 6 months ago
Reachability Analysis for Uncertain SSPs
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...
Olivier Buffet
99
Voted
ANOR
2006
101views more  ANOR 2006»
15 years 26 days ago
Comparison of wavelength requirements between two wavelength assignment methods in survivable WDM networks
We consider the routing and wavelength assignment (RWA) in survivable WDM network. A path protection scheme assumed and two different wavelength assignment methods for protection p...
Taehan Lee, Sungsoo Park
99
Voted
ICPR
2006
IEEE
16 years 1 months ago
Recover Writing Trajectory from Multiple Stroked Image Using Bidirectional Dynamic Search
The recovery of writing trajectory from offline handwritten image is generally regarded as a difficult problem [1]. This paper introduced a method to recover the writing trajector...
Yu Qiao, Makoto Yasuhara
112
Voted
ICALP
2009
Springer
16 years 1 months ago
A Survey of Stochastic Games with Limsup and Liminf Objectives
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
101
Voted
SAC
2004
ACM
15 years 6 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer