4007 search results - page 765 / 802 » Computation with imprecise probabilities |
164
Voted
SIGECOM
2005
ACM
15 years 10 months ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
143
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
147
click to vote
CHES
2005
Springer
2005
Springer
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
15 years 10 months ago
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
138
click to vote
FOSSACS
2005
Springer
15 years 10 months ago
2005
Springer
We study the concept of choice for true concurrency models such as prime event structures and safe Petri nets. We propose a dynamic variation of the notion of cluster previously in...
130
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, a novel variant of particle swarm optimization (PSO), named memetic particle swarm optimization algorithm (MeSwarm), is proposed for tackling the overshooting probl...