341 search results - page 66 / 69 » Decision Complexity in Dynamic Geometry |
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
DIGRA
2005
Springer
14 years 1 months ago
2005
Springer
Despite the fact that there are currently a number of enjoyable digital games in which light plays a key role, we lack a vocabulary with which to discuss simulated illumination in...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the dat...
CIAC
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...