Sciweavers

2354 search results - page 46 / 471
» Randomness, Stochasticity and Approximations
Sort
View
IAT
2006
IEEE
14 years 1 months ago
Using Prior Knowledge to Improve Distributed Hill Climbing
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
Roger Mailler
CIMAGING
2009
145views Hardware» more  CIMAGING 2009»
13 years 8 months ago
Wavelet-based Poisson rate estimation using the Skellam distribution
Owing to the stochastic nature of discrete processes such as photon counts in imaging, real-world data measurements often exhibit heteroscedastic behavior. In particular, time ser...
Keigo Hirakawa, Farhan A. Baqai, Patrick J. Wolfe
INFOCOM
2010
IEEE
13 years 6 months ago
Resource Allocation over Network Dynamics without Timescale Separation
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...
Alexandre Proutiere, Yung Yi, Tian Lan, Mung Chian...
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 6 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
ICEIS
2009
IEEE
14 years 2 months ago
A Service Composition Framework for Decision Making under Uncertainty
Proposed and developed is a service composition framework for decision-making under uncertainty, which is applicable to stochastic optimization of supply chains. Also developed is ...
Malak Al-Nory, Alexander Brodsky, Hadon Nash