1692 search results - page 269 / 339 » A Dynamic Network Interdiction Problem |
143
click to vote
PIMRC
2010
IEEE
15 years 12 days ago
2010
IEEE
In current cellular networks base stations (BSs) usually perform independent scheduling without coordinating the resource allocation among different cells. This, however, often lea...
117
Voted
VR
2002
IEEE
15 years 7 months ago
2002
IEEE
VRML97 allows the description of dynamic worlds that can change with both the passage of time, and user interaction. Unfortunately, the current VRML usage model prevents its full ...
109
Voted
MST
2007
15 years 2 months ago
2007
Consider a collection of r identical asynchronous mobile agents dispersed on an arbitrary anonymous network of size n. The agents all execute the same protocol and move from node ...
141
click to vote
MOBIDE
2003
ACM
15 years 7 months ago
2003
ACM
The common vision of pervasive computing environments requires a very large range of devices and software components to interoperate seamlessly. From the assumption that these dev...
154
Voted
EMMCVPR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...