1047 search results - page 105 / 210 » Searching Without a Heuristic: Efficient Use of Abstraction |
ICGI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...
MICRO
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract—High-speed routers often use commodity, fully-associative, TCAMs (Ternary Content Addressable Memories) to perform packet classification and routing (IP lookup). We prop...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
DATESO
2010
13 years 6 months ago
2010
Abstract. Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, i...