Sciweavers

3827 search results - page 254 / 766
» The Epsilon Generation Language
Sort
View
VLC
2002
153views more  VLC 2002»
15 years 6 months ago
An XML-based Quality of Service Enabling Language for the Web
In this paper, we introduce an XML-based Hierarchical QoS Markup Language, called HQML, to enhance distributed multimedia applications on the World Wide Web (WWW) with Quality of ...
Xiaohui Gu, Klara Nahrstedt, Wanghong Yuan, Duangd...
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
16 years 2 days ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
LCPC
2005
Springer
16 years 1 days ago
Optimizing Packet Accesses for a Domain Specific Language on Network Processors
Programming network processors remains a challenging task since their birth until recently when high-level programming environments for them are emerging. By employing domain speci...
Tao Liu, Xiao-Feng Li, Lixia Liu, Chengyong Wu, Ro...
USENIX
2000
15 years 7 months ago
FiST: A Language for Stackable File Systems
Traditional file system development is difficult. Stackable file systems promise to ease the development of file systems by offering a mechanism for incremental development. Unfor...
Erez Zadok, Jason Nieh
CC
2007
Springer
121views System Software» more  CC 2007»
15 years 6 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma