Sciweavers

19866 search results - page 400 / 3974
» Computing all factorizations in ***
Sort
View
ACNS
2005
Springer
81views Cryptology» more  ACNS 2005»
16 years 13 days ago
Searching for High-Value Rare Events with Uncheatable Grid Computing
Abstract. High-value rare-event searching is arguably the most natural application of grid computing, where computational tasks are distributed to a large collection of clients (wh...
Wenliang Du, Michael T. Goodrich
IPPS
1997
IEEE
15 years 11 months ago
Interactive Visual Exploration of Distributed Computations
Program understanding is central to the development of distributed computations, from the initial coding phase, through testing and debugging, to maintenance and support. Our goal...
Delbert Hart, Eileen Kraemer
170
Voted
ICC
2009
IEEE
127views Communications» more  ICC 2009»
16 years 1 months ago
A Study on Cross-Layer Multi-Constraint Path Computation for IP-Over-Optical Networks
— A powerful path computation element is a must for the next-generation IP-over-Optical networks to support ondemand service provisioning crossing layers. The main purpose of pat...
Xi Yang, Tom Lehman, Kenichi Ogaki, Tomohiro Otani
169
Voted
IPPS
2009
IEEE
16 years 1 months ago
An analysis of resource costs in a public computing grid
Public resource computing depends on the availability of computing resources that have been contributed by individuals. The amount of resources can be increased by incentivizing r...
John A. Chandy
APAL
1998
56views more  APAL 1998»
15 years 6 months ago
Turing Degrees of Certain Isomorphic Images of Computable Relations
A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the ...
Valentina S. Harizanov