16404 search results - page 158 / 3281 » A set coverage problem |
146
click to vote
RSCTC
2000
Springer
15 years 7 months ago
2000
Springer
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
125
Voted
AAAI
2006
15 years 4 months ago
2006
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
171
click to vote
SIAMCOMP
2008
15 years 1 months ago
2008
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
114
click to vote
DCC
2010
IEEE
15 years 3 months ago
2010
IEEE
Linear sets generalise the concept of subgeometries in a projective space. They have many applications in finite geometry. In this paper we address two problems for linear sets: t...
147
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...