4491 search results - page 490 / 899 » Algorithm Engineering |
157
click to vote
DAGSTUHL
1997
15 years 6 months ago
1997
In this paper we describe a simple and efficient ray casting engine that is suitable for the rapid exploration of irregular grids composed of tetrahedra cells, or other cell comp...
167
click to vote
C3S2E
2010
ACM
15 years 6 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
140
click to vote
HPDC
2010
IEEE
15 years 6 months ago
2010
IEEE
Automated analysis of unstructured text documents (e.g., web pages, newswire articles, research publications, business reports) is a key capability for solving important problems ...
147
click to vote
FSTTCS
2008
Springer
15 years 6 months ago
2008
Springer
ABSTRACT. We introduce a novel approach to the runtime monitoring of complex system properties. In particular, we present an online algorithm for a safety fragment of metric first...
128
click to vote
FSTTCS
2008
Springer
15 years 6 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...