Sciweavers

2086 search results - page 146 / 418
» Mathematical Theory Exploration
Sort
View
134
Voted
MP
2006
101views more  MP 2006»
15 years 3 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie
109
Voted
ACTAC
2002
75views more  ACTAC 2002»
15 years 3 months ago
Framework for Studying Substitution
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
Härmel Nestra
124
Voted
MLQ
2000
90views more  MLQ 2000»
15 years 3 months ago
Approximate Reasoning Based on Similarity
The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composin...
Loredana Biacino, Giangiacomo Gerla, Mingsheng Yin...
159
Voted
ICDAR
2009
IEEE
15 years 1 months ago
Issues in Performance Evaluation: A Case Study of Math Recognition
Performance evaluation of document recognition systems is a difficult and practically important problem. Issues arise in defining requirements, in characterizing the system's...
Adrien Lapointe, Dorothea Blostein
128
Voted
JUCS
2010
133views more  JUCS 2010»
14 years 10 months ago
From Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
Vladik Kreinovich, Bartlomiej Jacek Kubica