Sciweavers

1139 search results - page 79 / 228
» Bounded Ideation Theory
Sort
View
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
14 years 3 months ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
APAL
2010
141views more  APAL 2010»
13 years 9 months ago
Locatedness and overt sublocales
Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to ...
Bas Spitters
ICALP
2009
Springer
14 years 9 months ago
Approximating Markov Processes by Averaging
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
Philippe Chaput, Vincent Danos, Prakash Panangaden...
COMPGEOM
2003
ACM
14 years 2 months ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan
ISSRE
2002
IEEE
14 years 2 months ago
Worst Case Reliability Prediction Based on a Prior Estimate of Residual Defects
In this paper we extend an earlier worst case bound reliability theory to derive a worst case reliability function R(t), which gives the worst case probability of surviving a furt...
Peter G. Bishop, Robin E. Bloomfield