2079 search results - page 345 / 416 » Universality of random graphs |
161
click to vote
APPROX
2005
Springer
15 years 9 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...
135
click to vote
ICCAD
2000
IEEE
15 years 8 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...
140
click to vote
ECBS
1999
IEEE
15 years 8 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...
169
click to vote
PPDP
1999
Springer
15 years 8 months ago
1999
Springer
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
169
click to vote
TABLEAUX
1998
Springer
15 years 8 months ago
1998
Springer
ple (Extended Abstract) Edmund M. Clarke and Sergey Berezin Carnegie Mellon University -- USA Model checking is an automatic verification technique for finite state concurrent syst...