Sciweavers

834 search results - page 97 / 167
» Computing Minimal Models, Stable Models, and Answer Sets
Sort
View
FOCS
2009
IEEE
15 years 6 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
DAC
2010
ACM
14 years 10 months ago
SCEMIT: a systemc error and mutation injection tool
As high-level models in C and SystemC are increasingly used for verification and even design (through high-level synthesis) of electronic systems, there is a growing need for com...
Peter Lisherness, Kwang-Ting (Tim) Cheng
VLSID
2003
IEEE
134views VLSI» more  VLSID 2003»
16 years 7 days ago
A Framework for Energy and Transient Power Reduction during Behavioral Synthesis
Abstract-- In battery driven portable applications, the minimization of energy, average power, peak power, and peak power differential are equally important to improve reliability ...
Saraju P. Mohanty, N. Ranganathan
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
15 years 4 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld
ICSOC
2010
Springer
14 years 10 months ago
Service Discovery Using Communication Fingerprints
A request to a service registry must be answered with a service that fits in several regards, including semantic compatibility, non-functional compatibility, and interface compati...
Olivia Oanea, Jan Sürmeli, Karsten Wolf