1289 search results - page 100 / 258 » Complexity of Counting the Optimal Solutions |
PPL
2007
14 years 9 months ago
2007
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—A unique challenge in P2P network is that the peer dynamics (departure or failure) cause unavoidable disruption to the downstream peers. While many works have been dedicated to ...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
The size and complexity of systems based on multiple processing units demand techniques for the automatic diagnosis of their state. System-level diagnosis consists in determining ...
GECCO
2003
Springer
15 years 3 months ago
2003
Springer
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
MP
2007
14 years 9 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...