9532 search results - page 201 / 1907 » Logic, Graphs, and Algorithms |
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
124
click to vote
SAC
2010
ACM
15 years 9 months ago
2010
ACM
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
120
click to vote
ATVA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
114
Voted
MICCAI
2007
Springer
16 years 5 months ago
2007
Springer
133
Voted
KDD
2008
ACM
16 years 5 months ago
2008
ACM