Sciweavers

7123 search results - page 35 / 1425
» The Ordered Set of Rough Sets
Sort
View
DM
2007
103views more  DM 2007»
13 years 9 months ago
On the existence of difference sets in groups of order 96
The correspondence between a (96, 20, 4) symmetric design having regular automorphism group and a difference set with the same parameters has been used to obtain difference sets ...
Anka Golemac, Josko Mandic, Tanja Vucicic
IPPS
2000
IEEE
14 years 2 months ago
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
Jie Wu
MFCS
2005
Springer
14 years 3 months ago
Regular Sets of Higher-Order Pushdown Stacks
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...
Arnaud Carayol
AAAI
2010
13 years 10 months ago
First-Order Indefinability of Answer Set Programs on Finite Structures
An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence, otherwise this p...
Yin Chen, Yan Zhang, Yi Zhou
RSA
2008
85views more  RSA 2008»
13 years 9 months ago
On a universal best choice algorithm for partially ordered sets
For the only known universal best choice algorithm for partially ordered sets with known cardinality and unknown order (proposed by J. Preater) we improve the estimation of the lo...
Nicholas Georgiou, Malgorzata Kuchta, Michal Moray...