2645 search results - page 335 / 529 » time 2003 |
283
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
264
click to vote
POPL
2003
ACM
16 years 7 months ago
2003
ACM
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
152
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
Contrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We...
158
click to vote
ICDCSW
2003
IEEE
15 years 12 months ago
2003
IEEE
Nodes in ad hoc networks generally transmit data at regular intervals over long periods of time. Recently, ad hoc network nodes have been built that run on little power and have v...
182
click to vote
SIGECOM
2003
ACM
15 years 12 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...