537 search results - page 67 / 108 » A new upper bound for 3-SAT |
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
ICTCS
2005
Springer
14 years 2 months ago
2005
Springer
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in ...
PPAM
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
LCTRTS
2004
Springer
14 years 1 months ago
2004
Springer
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
DATE
2002
IEEE
14 years 1 months ago
2002
IEEE
This paper addresses verifying the timing of circuits containing level-sensitive latches in the presence of cross talk. We show that three consecutive periodic occurrences of the ...