Sciweavers

663 search results - page 124 / 133
» On the Foundations of Expected Expected Utility
Sort
View
CLUSTER
2004
IEEE
13 years 11 months ago
A comparison of local and gang scheduling on a Beowulf cluster
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
Peter E. Strazdins, John Uhlmann
DASFAA
2004
IEEE
86views Database» more  DASFAA 2004»
13 years 11 months ago
Supporting Exploratory Queries in Databases
Users of database applications, especially in the e-commerce domain, often resort to exploratory "trial-and-error" queries since the underlying data space is huge and unf...
Abhijit Kadlag, Amol V. Wanjari, Juliana Freire, J...
FTDCS
2004
IEEE
13 years 11 months ago
The vMatrix: Server Switching
Today most Internet services are pre-assigned to servers statically, hence preventing us from doing real-time sharing of a pool of servers across as group of services with dynamic...
Amr Awadallah, Mendel Rosenblum
ICSE
2000
IEEE-ACM
13 years 11 months ago
Galileo: a tool built from mass-market applications
We present Galileo, an innovative engineering modeling and analysis tool built using an approach we call packageoriented programming (POP). Galileo represents an ongoing evaluatio...
David Coppit, Kevin J. Sullivan
AAAI
2008
13 years 10 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang