Sciweavers

1517 search results - page 242 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
143
Voted
DEBS
2008
ACM
15 years 4 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
157
Voted
PPOPP
2010
ACM
15 years 2 months ago
Analyzing lock contention in multithreaded applications
Many programs exploit shared-memory parallelism using multithreading. Threaded codes typically use locks to coordinate access to shared data. In many cases, contention for locks r...
Nathan R. Tallent, John M. Mellor-Crummey, Allan P...
139
Voted
VALUETOOLS
2006
ACM
125views Hardware» more  VALUETOOLS 2006»
15 years 9 months ago
An approximative method for calculating performance measures of Markov processes
We present a new approximation method called value extrapolation for Markov processes with large or infinite state spaces. The method can be applied for calculating any performan...
Juha Leino, Jorma T. Virtamo
140
Voted
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
15 years 9 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
126
Voted
SEMWEB
2007
Springer
15 years 9 months ago
Change Paths in Reasoning!
Millions of research funding has been put down to develop - what I call - old forms - of reasoning that are characterized by strong focus on theoretical properties and strict adher...
Raphael Volz