1702 search results - page 167 / 341 » Using Nondeterminism to Design Efficient Deterministic Algor... |
ASPDAC
2007
ACM
14 years 2 months ago
2007
ACM
In today's designs, when functional verification fails, engineers perform debugging using the provided error traces. Reducing the length of error traces can help the debugging...
AIPS
2004
13 years 11 months ago
2004
In this paper, we show how a planner can use a modelchecking verifier to guide state space search. In our work on hard real-time, closed-loop planning, we use a modelchecker'...
WSCG
2004
13 years 11 months ago
2004
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...
CIKM
2004
Springer
14 years 3 months ago
2004
Springer
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
FPL
2008
Springer
13 years 12 months ago
2008
Springer
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...