Sciweavers

1359 search results - page 193 / 272
» Probabilistic Points-to Analysis
Sort
View
99
Voted
TPDS
2010
135views more  TPDS 2010»
14 years 11 months ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
113
Voted
EUSFLAT
2009
134views Fuzzy Logic» more  EUSFLAT 2009»
14 years 10 months ago
Flow Line Systems with Possibilistic Data: a System with Waiting Time in Line Uncertain
This paper proposes to analyze two flow line systems in which we include possibilistic data -the priority-discipline is possibilistic instead of probabilistic- and measure the perf...
David de la Fuente, María José Pardo
HIS
2009
14 years 10 months ago
On Some Properties of the lbest Topology in Particle Swarm Optimization
: Particle Swarm Optimization (PSO) is arguably one of the most popular nature- inspired algorithms for real parameter optimization at present. The existing theoretical research on...
Sayan Ghosh, Debarati Kundu, Kaushik Suresh, Swaga...
138
Voted
ICMI
2009
Springer
175views Biometrics» more  ICMI 2009»
14 years 10 months ago
Discovering group nonverbal conversational patterns with topics
This paper addresses the problem of discovering conversational group dynamics from nonverbal cues extracted from thin-slices of interaction. We first propose and analyze a novel t...
Dinesh Babu Jayagopi, Daniel Gatica-Perez
101
Voted
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
14 years 7 months ago
Universal scheduling for networks with arbitrary traffic, channels, and mobility
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...
Michael J. Neely