7289 search results - page 232 / 1458 » A Dependent Set Theory |
157
click to vote
CSC
2008
15 years 7 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
128
click to vote
TKDE
2008
15 years 5 months ago
2008
The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Ser...
222
click to vote
ADAC
2008
15 years 6 months ago
2008
We consider the problem of multiple fitting of linearly parametrized curves, that arises in many computer vision problems such as road scene analysis. Data extracted from images us...
166
click to vote
BIRTHDAY
2000
Springer
15 years 10 months ago
2000
Springer
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...
133
click to vote
EUSFLAT
2003
15 years 7 months ago
2003
Conventional approach to mathematical description of experiments applies probability theory. Here, another approach is used to express uncertainty based on probability, fuzzy sets...