Sciweavers

796 search results - page 131 / 160
» Problem Generation: Evaluation of Two Domains in Operating S...
Sort
View
AAAI
1998
14 years 11 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
CF
2008
ACM
14 years 11 months ago
A distributed evolutionary method to design scheduling policies for volunteer computing
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
Trilce Estrada, Olac Fuentes, Michela Taufer
TOMACS
2011
139views more  TOMACS 2011»
14 years 4 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
JVM
2004
133views Education» more  JVM 2004»
14 years 11 months ago
Towards Virtual Networks for Virtual Machine Grid Computing
Virtual machines can greatly simplify wide-area discomputing by lowering the level of abstraction to the benefit of both resource providers and users. Networking, however, can be ...
Ananth I. Sundararaj, Peter A. Dinda
KR
2000
Springer
15 years 1 months ago
Reasoning with Axioms: Theory and Practice
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
Ian Horrocks, Stephan Tobies