Sciweavers

1029 search results - page 132 / 206
» Compact representations of ordered sets
Sort
View
CP
2008
Springer
13 years 11 months ago
Length-Lex Bounds Consistency for Knapsack Constraints
Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionall...
Yuri Malitsky, Meinolf Sellmann, Willem Jan van Ho...
DGCI
2008
Springer
13 years 11 months ago
A New Fuzzy Connectivity Class Application to Structural Recognition in Images
Fuzzy sets theory constitutes a poweful tool, that can lead to more robustness in problems such as image segmentation and recognition. This robustness results to some extent from t...
Olivier Nempont, Jamal Atif, Enrico Angelini, Isab...
FUIN
2007
123views more  FUIN 2007»
13 years 10 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc
FSS
2010
111views more  FSS 2010»
13 years 8 months ago
The geometry of consonant belief functions: Simplicial complexes of necessity measures
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
Fabio Cuzzolin
MICS
2010
124views more  MICS 2010»
13 years 4 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger