Search

Your search keyword '"Set intervals"' showing total 4 results
Start Over Descriptor "Set intervals"
4 results on '"Set intervals"'

1. Definability in Incomplete Information Tables

Author

Hu, Mengjun, Yao, Yiyu, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Flores, Víctor, editor, Gomide, Fernando, editor, Janusz, Andrzej, editor, Meneses, Claudio, editor, Miao, Duoqian, editor, Peters, Georg, editor, Ślęzak, Dominik, editor, Wang, Guoyin, editor, Weber, Richard, editor, and Yao, Yiyu, editor

Published
2016
Full Text
View/download PDF

2. Solving set-valued constraint satisfaction problems.

Author

Jaulin, Luc

Subjects
*CONSTRAINT satisfaction, *SET-valued maps, *MATHEMATICAL variables, *SET theory, *INTERVAL analysis, *MATHEMATICAL analysis
Abstract

In this paper, we consider the resolution of constraint satisfaction problems in the case where the variables of the problem are subsets of $${\mathbb{R}^{n}}$$ . In order to use a constraint propagation approach, we introduce set intervals (named i-sets), which are sets of subsets of $${\mathbb{R}^{n}}$$ with a lower bound and an upper bound with respect to the inclusion. Then, we propose basic operations for i-sets. This makes possible to build contractors that are then used by the propagation to solve problem involving sets as unknown variables. In order to illustrate the principle and the efficiency of the approach, a testcase is provided. [ABSTRACT FROM AUTHOR]

Published
2012
Full Text
View/download PDF

3. Avoiding Fake Boundaries in Set Interval Computing

Author

Welte , Anthony, Jaulin , Luc, Ceberio , Martine, Kreinovich , Vladik, Laboratoire Chrono-environnement ( LCE ), Université Bourgogne Franche-Comté ( UBFC ) -Centre National de la Recherche Scientifique ( CNRS ) -Université de Franche-Comté ( UFC ), Lab-STICC_ENSTAB_CID_PRASYS, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance ( Lab-STICC ), École Nationale d'Ingénieurs de Brest ( ENIB ) -Université de Bretagne Sud ( UBS ) -Université de Brest ( UBO ) -ENSTA Bretagne-Institut Mines-Télécom [Paris]-Centre National de la Recherche Scientifique ( CNRS ) -Université Bretagne Loire ( UBL ) -IMT Atlantique Bretagne-Pays de la Loire ( IMT Atlantique ) -École Nationale d'Ingénieurs de Brest ( ENIB ) -Université de Bretagne Sud ( UBS ) -Université de Brest ( UBO ) -ENSTA Bretagne-Institut Mines-Télécom [Paris]-Centre National de la Recherche Scientifique ( CNRS ) -Université Bretagne Loire ( UBL ) -IMT Atlantique Bretagne-Pays de la Loire ( IMT Atlantique ), Pôle STIC_OSM, ENSTA Bretagne, University of Texas at El Paso - UTEP (USA), Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), Institut Mines-Télécom [Paris] (IMT)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-Institut Mines-Télécom [Paris] (IMT)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL), École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne), University of Texas [El Paso] (UTEP ), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), and Institut Mines-Télécom [Paris] (IMT)

Subjects
[SPI]Engineering Sciences [physics], spatial localization, [ SPI.AUTO ] Engineering Sciences [physics]/Automatic, [ SPI ] Engineering Sciences [physics], set intervals, fake boundaries, [SPI.AUTO]Engineering Sciences [physics]/Automatic
Abstract

International audience; Set intervals techniques are an efficient way of dealing with uncertainty in spatial localization problems. In these techniques, the desired set (e.g., set of possible locations) is represented by an expression that uses intersection, union, and complement of input sets – which are usually only known with interval uncertainty. To find the desired set, we can, in principle, perform the corresponding set-interval computations one-by-one. However, the estimates obtained by such straightforward computations often contain extra elements – e.g., fake boundaries. It was known that we can eliminate these fake boundaries (and other extra elements) if we first transform the original set expression into an appropriate DNF/CNF form. In this paper, we prove a new result, that any DNF/CNF form enables us to eliminate the extra elements – thus, we can use the shortest possible DNF/CNF form and therefore, speed up the corresponding computations.

Published
2017

4. Solving set-valued constraint satisfaction problems

Author

Luc Jaulin, Lab-STICC_ENSTAB_CID_IHSEV, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS), Pôle STIC_OSM, and École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)

Subjects
0102 computer and information sciences, 02 engineering and technology, Constraint satisfaction, 01 natural sciences, Upper and lower bounds, Theoretical Computer Science, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Combinatorics, Constraint logic programming, 0202 electrical engineering, electronic engineering, information engineering, Interval analysis, Contractors, Set intervals, Constraint satisfaction problem, Mathematics, Discrete mathematics, Numerical Analysis, Hybrid algorithm (constraint satisfaction), Order (ring theory), Constraint propagation, Computer Science Applications, Computational Mathematics, Computational Theory and Mathematics, 010201 computation theory & mathematics, Constraint graph, Local consistency, 020201 artificial intelligence & image processing, Software
Abstract

In this paper, we consider the resolution of constraint satisfaction problems in the case where the variables of the problem are subsets of $${\mathbb{R}^{n}}$$. In order to use a constraint propagation approach, we introduce set intervals (named i-sets), which are sets of subsets of $${\mathbb{R}^{n}}$$ with a lower bound and an upper bound with respect to the inclusion. Then, we propose basic operations for i-sets. This makes possible to build contractors that are then used by the propagation to solve problem involving sets as unknown variables. In order to illustrate the principle and the efficiency of the approach, a testcase is provided.

Published
2012
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results