989 search results - page 137 / 198 » Pebbling and Proofs of Work |
DATE
2010
IEEE
14 years 1 months ago
2010
IEEE
— Many CAD for VLSI problems can be naturally encoded as Quantified Boolean Formulas (QBFs) and solved with QBF solvers. Furthermore, such problems often contain circuitbased in...
COOPIS
2002
IEEE
14 years 1 months ago
2002
IEEE
The Semantic Web is a vision of the next generation Web, in which semantic markup will make Web resources more accessible to automatic processes. Description Logics (DLs) are of cr...
DATE
2002
IEEE
14 years 29 days ago
2002
IEEE
We have developed a technique to compute a Quasi Static Schedule of a concurrent specification for the software partition of an embedded system. Previous work did not take into a...
FOCS
2002
IEEE
14 years 29 days ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
ICCHP
2010
Springer
14 years 24 days ago
2010
Springer
Crossing an urban traffic intersection is one of the most dangerous activities of a blind or visually impaired person's travel. Building on past work by the authors on the iss...