871 search results - page 172 / 175 » The vertex-cover polynomial of a graph |
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
RTSS
1992
IEEE
15 years 1 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
180
Voted
NLP
2000
15 years 1 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...