Sciweavers

8780 search results - page 175 / 1756
» On the Feasibility of Consistent Computations
Sort
View
LICS
2003
IEEE
16 years 13 days ago
Polynomial-time Algorithms from Ineffective Proofs
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
Paulo Oliva
CORR
2010
Springer
156views Education» more  CORR 2010»
15 years 5 months ago
Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
I-Hong Hou, P. R. Kumar
DAC
2009
ACM
16 years 8 months ago
ILP-based pin-count aware design methodology for microfluidic biochips
Digital microfluidic biochips have emerged as a popular alternative for laboratory experiments. To make the biochip feasible for practical applications, pin-count reduction is a k...
Cliff Chiung-Yu Lin, Yao-Wen Chang
DAC
2000
ACM
16 years 8 months ago
Embedded hardware and software self-testing methodologies for processor cores
At-speed testing of GHz processors using external testers may not be technically and economically feasible. Hence, there is an emerging need for low-cost, high-quality self-test m...
Li Chen, Sujit Dey, Pablo Sanchez, Krishna Sekar, ...
WWW
2006
ACM
16 years 7 months ago
Examining the content and privacy of web browsing incidental information
This research examines the privacy comfort levels of participants if others can view traces of their web browsing activity. During a week-long field study, participants used an el...
Kirstie Hawkey, Kori M. Inkpen