3702 search results - page 371 / 741 » All Pairings Are in a Group |
217
click to vote
ESA
2009
Springer
16 years 2 months ago
2009
Springer
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
196
click to vote
SUM
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Logic-based argumentation offers an approach to querying and revising multiple ontologies that are inconsistent or incoherent. A common assumption for logic-based argumen...
167
click to vote
ASPDAC
2009
ACM
16 years 2 months ago
2009
ACM
— 1In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of pl...
188
click to vote
COMPGEOM
2009
ACM
16 years 2 months ago
2009
ACM
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...
151
click to vote
SIGECOM
2009
ACM
16 years 2 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...