16404 search results - page 211 / 3281 » A set coverage problem |
127
Voted
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
135
click to vote
CINQ
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Instance retraction is a difficult problem for concept learning by version spaces. This chapter introduces a family of version-space representations called one-sided inst...
139
Voted
ACMICEC
2003
ACM
15 years 9 months ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
136
Voted
SIGECOM
2003
ACM
15 years 9 months ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
123
Voted
ICES
2003
Springer
15 years 9 months ago
2003
Springer
Evolvable Hardware (EHW) has been proposed as a new method for evolving circuits automatically. One of the problems appearing is that only circuits of limited size are evolvable. I...