2314 search results - page 220 / 463 » Monoids over domains |
167
click to vote
NETWORKING
2007
15 years 8 months ago
2007
In the next generation backbone networks, IP/MPLS over optical networks, the ability to maintain an acceptable level of reliability has become crucial since a failure can result in...
157
click to vote
AIPS
2006
15 years 8 months ago
2006
Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order ...
174
click to vote
AIPS
2006
15 years 8 months ago
2006
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
161
click to vote
FLAIRS
2006
15 years 8 months ago
2006
We propose a new decision-theoretic approach for solving execution-time deliberation scheduling problems using recent advances in Generalized Semi-Markov Decision Processes (GSMDP...
183
click to vote
ICVGIP
2004
15 years 8 months ago
2004
Shape from Shading (SFS) is one of the most extensively studied problems in Computer Vision. However, most of the approaches only deal with Lambertian or other specific shading mo...