Sciweavers

6409 search results - page 472 / 1282
» A Computational Algorithm for Origami Design
Sort
View
UAI
2000
15 years 8 months ago
Pivotal Pruning of Trade-offs in QPNs
Qualitative probabilistic networks have been designed for probabilistic reasoning in a qualitative way. Due to their coarse level of representation detail, qualitative probabilist...
Silja Renooij, Linda C. van der Gaag, Simon Parson...
CLUSTER
2009
IEEE
16 years 1 months ago
Power-aware scheduling of virtual machines in DVFS-enabled clusters
—With the advent of Cloud computing, large-scale virtualized compute and data centers are becoming common in the computing industry. These distributed systems leverage commodity ...
Gregor von Laszewski, Lizhe Wang, Andrew J. Younge...
PET
2004
Springer
16 years 7 days ago
Secure Outsourcing of Sequence Comparisons
Internet computing technologies, like grid computing, enable a weak computational device connected to such a grid to be less limited by its inadequate local computational, storage,...
Mikhail J. Atallah, Jiangtao Li
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
16 years 25 days ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert
SC
2005
ACM
16 years 13 days ago
ClawHMMER: A Streaming HMMer-Search Implementation
The proliferation of biological sequence data has motivated the need for an extremely fast probabilistic sequence search. One method for performing this search involves evaluating...
Daniel Reiter Horn, Mike Houston, Pat Hanrahan