Sciweavers

5210 search results - page 150 / 1042
» Computing Capabilities of Mediators
Sort
View
COCO
2007
Springer
75views Algorithms» more  COCO 2007»
14 years 4 months ago
On the Theory of Matchgate Computations
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
Jin-yi Cai, Vinay Choudhary, Pinyan Lu
GRID
2007
Springer
14 years 4 months ago
Load prediction using hybrid model for computational grid
—Due to the dynamic nature of grid environments, schedule algorithms always need assistance of a long-time-ahead load prediction to make decisions on how to use grid resources ef...
Yongwei Wu, Yulai Yuan, Guangwen Yang, Weimin Zhen...
WADS
2007
Springer
98views Algorithms» more  WADS 2007»
14 years 4 months ago
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
Senjuti Basu Roy, Gautam Das, Sajal Das
IPPS
2006
IEEE
14 years 4 months ago
A simulator for parallel applications with dynamically varying compute node allocation
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
Basile Schaeli, B. Gerlach, Roger D. Hersch
PDCAT
2005
Springer
14 years 3 months ago
Trusted Computing-Based Security Architecture For 4G Mobile Networks
In this paper security requirements and security architecture for 4G systems are presented with the consideration of Trusted Computing (TC) for mobile equipment (ME). The security...
Yu Zheng, Dake He, Weichi Yu, Xiaohu Tang