356 search results - page 41 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
COCOA
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
124
click to vote
CAAN
2007
Springer
15 years 4 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
78
Voted
GD
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
103
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
99
Voted
ICCAD
1993
IEEE
15 years 4 months ago
1993
IEEE
We present a design style and synthesis algorithm that encompasses both asynchronous and synchronous state machines. Our proposed design style not only supports generalized “bur...