86 search results - page 16 / 18 » Polynomial Constraints for Sets with Cardinality Bounds |
TCC
2009
Springer
16 years 5 days ago
2009
Springer
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
176
click to vote
VLDB
2002
ACM
15 years 12 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
100
click to vote
ADHOCNOW
2008
Springer
15 years 6 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
106
click to vote
AAAI
2010
15 years 1 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
129
click to vote
COMGEO
2012
ACM
13 years 7 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...