5606 search results - page 704 / 1122 » Randomization Techniques for Graphs. |
157
click to vote
ASPDAC
2009
ACM
15 years 10 months ago
2009
ACM
—Redundant via insertion is a widely recommended technique to enhance the via yield and reliability. In this paper, the post-routing redundant via insertion problem is transforme...
159
click to vote
AAAI
2007
15 years 9 months ago
2007
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a Reprod...
158
click to vote
AIPS
2004
15 years 8 months ago
2004
Scaling conformant planning is a problem that has received much attention of late. Many planners solve the problem as a search in the space of belief states, and some heuristic gu...
173
click to vote
IPCO
2001
15 years 8 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
189
click to vote
IJCAI
2003
15 years 8 months ago
2003
Hyperlink analysis is a successful approach to define algorithms which compute the relevance of a document on the basis of the citation graph. In this paper we propose a technique...