3353 search results - page 89 / 671 » Laver and set theory |
173
click to vote
COMPGEOM
2009
ACM
16 years 24 days ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
156
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
188
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
178
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
177
click to vote
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
One of the most challenging aspects of reasoning, planning, and acting in a multi-agent domain is reasoning about what the agents know about the knowledge of their fellows, and to...