Sciweavers

13784 search results - page 118 / 2757
» On Computing Functions with Uncertainty
Sort
View
SOFSEM
2007
Springer
14 years 3 months ago
Games, Time, and Probability: Graph Models for System Design and Analysis
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
Thomas A. Henzinger
ENTCS
2008
98views more  ENTCS 2008»
13 years 8 months ago
On Finite-time Computability Preserving Conversions
: A finite-time computable function is a partial function from to whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computabili...
Hideki Tsuiki, Shuji Yamada
ICPR
2010
IEEE
14 years 4 months ago
Robust Matching in an Uncertain World
Finding point correspondences which are consistent with a geometric constraint is one of the cornerstones of many computer vision problems. This is a difficult task because of sp...
Frédéric Sur
SAGA
2009
Springer
14 years 3 months ago
Scenario Reduction Techniques in Stochastic Programming
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
Werner Römisch
IAT
2009
IEEE
14 years 3 months ago
Extending Alternating-Offers Bargaining in One-to-Many and Many-to-Many Settings
Automating negotiations in markets where multiple buyers and sellers operate is a scientific challenge of extraordinary importance. One-to-one negotiations are classically studie...
Bo An, Nicola Gatti, Victor R. Lesser