نتایج جستجو برای: polyhedral ambiguity set

تعداد نتایج: 681730  

2012
Kazuhisa Takemura

Comparative judgment is essential in human social lives. Comparative judgment is a type of human judgment procedure, in which the evaluator is asked which alternative is preferred (e.g., “Do you prefer Brand A to Brand B?” or “How do you estimate the probability of choosing Brand A over Brand B when you compare the two brands? ”). This type of judgment is distinguished from absolute judgment, i...

2012
Patrick Paroubek Xavier Tannier

In this paper, we present the founding elements of a formal model of the evaluation paradigm in natural language processing. We propose an abstract model of objective quantitative evaluation based on rough sets, as well as the notion of potential performance space for describing the performance variations corresponding to the ambiguity present in hypothesis data produced by a computer program, ...

2014
Frank Kammer Maarten Löffler Paul Mutser Frank Staals

We study the problem of placing guard towers on a terrain such that the terrain can be seen from at least one tower. This problem is important in many applications, and has an extensive history in the literature (known as, e.g., multiple observer siting). In this paper, we consider the problem on polyhedral terrains, and we allow the guards to see only a fixed fraction of the terrain, rather th...

Triangular intuitionistic fuzzy numbers (TIFNs) is a special case of intuitionistic fuzzy (IF) set and the ranking of TIFNs is an important problem. The aim of this paper is to develop a new methodology for ranking TIFNs by using multiattribute decision making methods (MADM). In this methodology, the value and ambiguity indices of TIFNs may be considered as the attributes and the TIFNs in compa...

Journal: :Games and Economic Behavior 2013
Matthias Lang Achim Wambach

Most insurance companies publish few data on the occurrence and detection of insurance fraud. This stands in contrast to the previous literature on costly state verification, which has shown that it is optimal to commit to an auditing strategy, as the credible announcement of thoroughly auditing claim reports might act as a powerful deterrent. We show that uncertainty about fraud detection can ...

Journal: :bulletin of the iranian mathematical society 2015
m. minisker

in this paper a certain class of polyhedral semigroups which has a presentation $$ is examined‎. ‎the completeness of the presentation and solvability of word problem of this class of semigroups is determined‎. ‎moreover the combinatorial distance between two words is determined‎.

Journal: :IEEE Trans. Automat. Contr. 2003
Alongkrit Chutinan Bruce H. Krogh

This paper concerns computational methods for verifying properties of polyhedral invariant hybrid automata (PIHA), which are hybrid automata with discrete transitions governed by polyhedral guards. To verify properties of the state trajectories for PIHA, the planar switching surfaces are partitioned to define a finite set of discrete states in an approximate quotient transition system (AQTS). S...

1996
Enrico Puppo

A model for the multiresolution decomposition of planar domains into triangles is introduced, which is more general than other multiresolution models proposed in the literature, and can be eeciently applied to the representation of a polyhedral terrain at variable resolution. The model is based on a collection of fragments of plane triangulations arranged into a partially ordered set. Diierent ...

Journal: :Games and Economic Behavior 2013
Sam Aflaki

A Working Paper is the author's intellectual property. It is intended as a means to promote research to interested readers. Its content should not be copied or hosted on any server without written permission from publications. We model a common pool resource game under environmental uncertainty. A symmetric group of individuals face the dilemma of sharing a common resource: each player chooses ...

Journal: :Automatica 2008
Tobias Geyer Fabio Danilo Torrisi Manfred Morari

This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Firstly, the paper presents two computationally attractive algorithms for optimal complexity reduction that, under the assumption that the system is defined over the cells of a hyperplane arrangement, derive an equivalen...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید