Sciweavers

27827 search results - page 5373 / 5566
» Generating
Sort
View
CC
2007
Springer
121views System Software» more  CC 2007»
15 years 1 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
CCR
2007
86views more  CCR 2007»
15 years 1 months ago
An addressing independent networking structure favorable for all-optical packet switching
All-optical packet switching (AOPS) technology is essential to fully utilize the tremendous bandwidth provided by advanced optical communication techniques through forwarding pack...
Shengming Jiang
GRID
2006
Springer
15 years 1 months ago
Toward an On-Demand Restricted Delegation Mechanism for Grids
Grids are intended to enable cross-organizational interactions which makes Grid security a challenging and nontrivial issue. In Grids, delegation is a key facility that can be used...
Mehran Ahsant, Jim Basney, Olle Mulmo, Adam J. Lee...
CE
2007
176views more  CE 2007»
15 years 1 months ago
Pedagogical approaches for technology-integrated science teaching
The two separate projects described have examined how teachers exploit computer-based technologies in supporting learning of science at secondary level. This paper examines how pe...
Sara Hennessy, Jocelyn Wishart, Denise Whitelock, ...
128
Voted
GRID
2006
Springer
15 years 1 months ago
Resource Allocation in Streaming Environments
This paper considers resource allocation algorithms for processing streams of events on computational grids. For example, financial trading applications are executed on large comp...
Lu Tian, K. Mani Chandy
« Prev « First page 5373 / 5566 Last » Next »