4066 search results - page 95 / 814 » Almost Complete Sets |
126
click to vote
FSS
2008
15 years 6 months ago
2008
In this work we give a state-of-the-art review of two of the most established classes of fuzzy implications, viz., (S, N)- and R-implications. Firstly, we discuss their properties...
170
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
148
click to vote
FSTTCS
2007
Springer
16 years 13 days ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
172
click to vote
JCIT
2008
15 years 6 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
175
click to vote
TPHOL
2005
IEEE
15 years 12 months ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...