2899 search results - page 144 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
187
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
178
click to vote
ISCA
2005
IEEE
15 years 11 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
168
Voted
CISS
2008
IEEE
16 years 16 days ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
128
click to vote
OPODIS
2004
15 years 7 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
169
click to vote
VMV
2003
15 years 7 months ago
2003
We propose a new approach to collision and self– collision detection of dynamically deforming objects that consist of tetrahedrons. Tetrahedral meshes are commonly used to repre...