307 search results - page 55 / 62 » Finite locally-quasiprimitive graphs |
215
click to vote
ICTAI
2009
IEEE
15 years 4 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
152
click to vote
HICSS
2006
IEEE
16 years 21 days ago
2006
IEEE
Spam e-mails have become a serious technological and economic problem. So far we have been reasonably able to resist spam e-mails and use the Internet for regular communication by...
168
click to vote
ATS
2003
IEEE
15 years 12 months ago
2003
IEEE
Software-based self-testing is a promising approach for the testing of processor cores which are embedded inside a System-on-a-Chip (SoC), as it can apply test vectors in function...
212
click to vote
TABLEAUX
1998
Springer
15 years 11 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...
159
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...