721 search results - page 126 / 145 » Almost universal graphs |
179
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
127
click to vote
ASM
2005
ASM
15 years 10 months ago
2005
ASM
lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, US...
148
Voted
ICCAD
2000
IEEE
15 years 9 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
148
Voted
CP
2000
Springer
15 years 9 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
147
click to vote
ECBS
1999
IEEE
15 years 9 months ago
1999
IEEE
Researchers have defined a number of process modeling methods and have developed in-roads to process-centered environments that support process modeling and project control. Howev...