1712 search results - page 126 / 343 » A Computational Approach to Binding Theory |
126
click to vote
WEA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
142
click to vote
SIGECOM
2011
ACM
14 years 4 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
DIGRA
2003
Springer
15 years 7 months ago
2003
Springer
Communication between players in networked computer games is often inadequately implemented. The games do not exploit the full potential of using different forms of communication ...
118
click to vote
IJCINI
2007
15 years 1 months ago
2007
: The theme of this issue of IJCINI is on cognitive mechanisms of autonomic computing and laws of human cooperative work organization. This editorial addresses key notions of this ...
109
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...