894 search results - page 130 / 179 » Game Theory with Costly Computation |
94
Voted
SIGMETRICS
2002
ACM
15 years 1 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
133
click to vote
SPAA
2006
ACM
15 years 7 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
124
Voted
SPAA
2006
ACM
15 years 7 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
123
Voted
CEC
2009
IEEE
15 years 8 months ago
2009
IEEE
Differential evolution (DE) is a powerful yet simple evolutionary algorithm for optimizing real valued optimization problems. Traditional investigations with differential evolution...
99
Voted
LICS
2005
IEEE
15 years 7 months ago
2005
IEEE
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthemâ€...