Sciweavers

3353 search results - page 111 / 671
» Laver and set theory
Sort
View
SPAA
2010
ACM
15 years 2 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
RSCTC
2000
Springer
227views Fuzzy Logic» more  RSCTC 2000»
15 years 1 months ago
Rough Sets in Approximate Spatial Reasoning
Abstract. In spatial reasoning the qualitative description of relations between spatial regions is of practical importance and has been widely studied. Examples of such relations a...
Thomas Bittner, John G. Stell
FUIN
2006
160views more  FUIN 2006»
14 years 10 months ago
Behavioral Pattern Identification Through Rough Set Modeling
This paper introduces an approach to behavioral pattern identification as a part of a study of temporal patterns in complex dynamical systems. Rough set theory introduced by Zdzisl...
Jan G. Bazan
ESWA
2007
105views more  ESWA 2007»
14 years 9 months ago
Applying rough sets to prevent customer complaints for IC packaging foundry
Packaging is classified as one of back-end processes in the integrated circuits (ICs) manufacturing, highly capital-intensive and involves complex processes. Unlike the front-end...
Hsu-Hao Yang, Tzu-Chiang Liu, Yen-Ting Lin
CADE
2006
Springer
15 years 10 months ago
Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
Robert L. Constable, Wojciech Moczydlowski