2314 search results - page 71 / 463 » Minimal Partitions of a Graph |
128
click to vote
CIMCA
2005
IEEE
15 years 9 months ago
2005
IEEE
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
145
Voted
CASES
2010
ACM
15 years 6 days ago
2010
ACM
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
136
Voted
IM
2007
15 years 3 months ago
2007
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
168
Voted
AAIM
2007
Springer
15 years 9 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
93
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Iterated regret minimization has been introduced recently by J.Y. Halpern and R. Pass in classical strategic games. For many games of interest, this new solution concept provides s...