2771 search results - page 205 / 555 » Using Computational Reflection in Optimistic Distributed Sim... |
156
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
179
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of con...
160
click to vote
PARELEC
2006
IEEE
16 years 10 days ago
2006
IEEE
At our university, we have a number of small-tomedium-size compute clusters and some technical simulations which could benefit from using several of these clusters simulaneously....
155
click to vote
HPDC
2009
IEEE
16 years 1 months ago
2009
IEEE
Advances in the development of large scale distributed computing systems such as Grids and Computing Clouds have intensified the need for developing scheduling algorithms capable...
172
click to vote
GRID
2007
Springer
16 years 15 days ago
2007
Springer
Since grid computing provides users with more distributed computing and storage resources, it gives us an opportunity to design new efficient and robust solvers for the numerical...