Sciweavers

518 search results - page 83 / 104
» Beating a Random Assignment
Sort
View
JPDC
2007
92views more  JPDC 2007»
15 years 2 months ago
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
Jong-Kook Kim, Sameer Shivle, Howard Jay Siegel, A...
AMAI
2002
Springer
15 years 2 months ago
Nonmonotonicity and Compatibility Relations in Belief Structures
: We concern ourselves with the situation Here we investigate an extension of the basic concept of in which we use the Dempster-Shafer belief structure to a compatibility relation ...
Ronald R. Yager
ECCV
2010
Springer
15 years 5 months ago
Automatic Learning of Background Semantics in Generic Surveilled Scenes
Advanced surveillance systems for behavior recognition in outdoor traffic scenes depend strongly on the particular configuration of the scenario. Scene-independent trajectory analy...
Carles Fernández, Jordi Gonzàlez, Xavier Roca
CORR
2004
Springer
218views Education» more  CORR 2004»
15 years 2 months ago
A Dynamic Clustering-Based Markov Model for Web Usage Mining
Markov models have been widely utilized for modelling user web navigation behaviour. In this work we propose a dynamic clustering-based method to increase a Markov model's ac...
José Borges, Mark Levene
CORR
2000
Springer
91views Education» more  CORR 2000»
15 years 2 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber