Sciweavers

1205 search results - page 42 / 241
» On P Systems with Bounded Parallelism
Sort
View
CORR
2007
Springer
77views Education» more  CORR 2007»
13 years 7 months ago
Quantization Bounds on Grassmann Manifolds of Arbitrary Dimensions and MIMO Communications with Feedback
— This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volum...
Wei Dai, Youjian Liu, Brian Rider
SWAT
1994
Springer
120views Algorithms» more  SWAT 1994»
13 years 11 months ago
Parallel Dynamic Lowest Common Ancestors
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Erik Schenk
ICPP
2007
IEEE
14 years 1 months ago
Defending P2Ps from Overlay Flooding-based DDoS
A flooding-based search mechanism is often used in unstructured P2P systems. Although a flooding-based search mechanism is simple and easy to implement, it is vulnerable to overla...
Yunhao Liu, Xiaomei Liu, Chen Wang, Li Xiao
SKG
2006
IEEE
14 years 1 months ago
Dynamic Setting, Verification and Adjustment of Upper Bound Constraints in Grid Workflow Systems
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...
Jinjun Chen, Yun Yang
ICPP
2009
IEEE
14 years 2 months ago
Improving Resource Availability by Relaxing Network Allocation Constraints on Blue Gene/P
— High-end computing (HEC) systems have passed the petaflop barrier and continue to move toward the next frontier of exascale computing. As companies and research institutes con...
Narayan Desai, Darius Buntinas, Daniel Buettner, P...