305 search results - page 6 / 61 » Randomization for Multi-agent Constraint Optimization |
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
We present a statistical optimization framework for solving the end-to-end problem of progressive transmission of images over noisy channels. We consider the impacts of transmissi...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
— We consider a peer-to-peer network where nodes can send and receive files amongst their peers. File requests are generated randomly, and each new file can correspond to a dif...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Conditional random fields(CRFs) are a class of undirected graphical models which have been widely used for classifying and labeling sequence data. The training of CRFs is typicall...
TSP
2008
13 years 7 months ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...