Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 4 of 4
Full-Text Articles in Mathematics
When Is A Single "And"-Condition Enough?, Olga Kosheleva, Vladik Kreinovich
When Is A Single "And"-Condition Enough?, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In many practical situations, there are several possible decisions. Any general recommendation means specifying, for each possible decision, conditions under which this decision is recommended. In some cases, a single "and"-condition is sufficient: e.g., a condition under which a patient is recommended to take aspirin is that "the patient has a fever and the patient does not have stomach trouble". In other cases, conditions are more complicated. A natural question is: when is a single "and"-condition enough? In this paper, we provide an answer to this question.
How To Make Decision Under Interval Uncertainty: Description Of All Reasonable Partial Orders On The Set Of All Intervals, Tiago M. Costa, Olga Kosheleva, Vladik Kreinovich
How To Make Decision Under Interval Uncertainty: Description Of All Reasonable Partial Orders On The Set Of All Intervals, Tiago M. Costa, Olga Kosheleva, Vladik Kreinovich
Departmental Technical Reports (CS)
In many practical situations, we need to make a decision while for each alternative, we only know the corresponding value of the objective function with interval uncertainty. To help a decision maker in this situation, we need to know the (in general, partial) order on the set of all intervals that corresponds to the preferences of the decision maker. For this purpose, in this paper, we provide a description of all such partial orders -- under some reasonable conditions. It turns out that each such order is characterized by two linear inequalities relating the endpoints of the corresponding intervals, and …
A Survey On Online Matching And Ad Allocation, Ryan Lee
A Survey On Online Matching And Ad Allocation, Ryan Lee
Theses
One of the classical problems in graph theory is matching. Given an undirected graph, find a matching which is a set of edges without common vertices. In 1990s, Richard Karp, Umesh Vazirani, and Vijay Vazirani would be the first computer scientists to use matchings for online algorithms [8]. In our domain, an online algorithm operates in the online setting where a bipartite graph is given. On one side of the graph there is a set of advertisers and on the other side we have a set of impressions. During the online phase, multiple impressions will arrive and the objective of …
Types Of Questions Teachers Ask To Engage Students In Making Sense Of A Student Contribution, Nishat B. Alam
Types Of Questions Teachers Ask To Engage Students In Making Sense Of A Student Contribution, Nishat B. Alam
Dissertations, Master's Theses and Master's Reports
In the student-centered classroom, a teacher’s interpretation and response to student mathematical contributions plays an important role to shape and direct students’ opportunities for sense-making. This research used a scenario-based survey questionnaire to examine what types of questions middle and high school mathematics teachers indicate they would ask to engage students in making sense of a high-leverage student mathematical contribution and their reasoning about why particular questions are or are not productive. From the results, it could be concluded that teachers asked more productive questions after seeing a set of possible questions. Their beliefs about the productivity of the questions …