Sciweavers

342 search results - page 39 / 69
» Prerequisites for collaborative problem solving
Sort
View
SAC
2010
ACM
14 years 3 months ago
Trustworthy interaction balancing in mixed service-oriented systems
Web-based collaboration systems typically require dynamic and context-based interactions between people and services. To support such complex interaction scenarios, we introduce a...
Florian Skopik, Daniel Schall, Schahram Dustdar
GLOBECOM
2008
IEEE
13 years 8 months ago
Network Planning for Next-Generation Metropolitan-Area Broadband Access under EPON-WiMAX Integration
Abstract--This paper tackles a fundamental problem of network planning and dimensioning under EPON-WiMAX integration for next-generation wireless metropolitan-area broadband access...
Bin Lin, Pin-Han Ho, Xuemin Shen, Frank Chih-Wei S...
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
14 years 2 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
ERCIMDL
2001
Springer
178views Education» more  ERCIMDL 2001»
14 years 1 months ago
Customizable Retrieval Functions Based on User Tasks in the Cultural Heritage Domain
The cultural heritage domain dealing with digital surrogates of rare and fragile historic artifacts is one of the most promising areas for establishing collaboratories, i.e. shared...
Holger Brocks, Ulrich Thiel, Adelheit Stein, Andre...
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 8 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