11345 search results - page 435 / 2269 » Foundations of Computer Science |
185
click to vote
COMPGEOM
2009
ACM
16 years 1 months 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...
248
click to vote
HPDC
2006
IEEE
16 years 27 days ago
2006
IEEE
By federating resources from multiple domains, a shared infrastructure provides aggregated computation resources to a large number of users. With rapid advances in virtualization ...
199
click to vote
MOBIHOC
2003
ACM
16 years 3 days ago
2003
ACM
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
157
click to vote
PODC
1989
ACM
15 years 11 months ago
1989
ACM
: What should it mean for an agent to know or believe an assertion is true with probability :99? Di erent papers FH88, FZ88, HMT88] give di erent answers, choosing to use quite di ...
186
click to vote
CF
2006
ACM
15 years 10 months ago
2006
ACM
Adaptive mesh refinement (AMR) is a powerful technique that reduces the resources necessary to solve otherwise intractable problems in computational science. The AMR strategy solv...