596 search results - page 116 / 120 » Complexity Analysis by Graph Rewriting |
106
click to vote
MOBICOM
2003
ACM
15 years 4 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
PODC
2003
ACM
15 years 4 months ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
89
Voted
SPAA
2003
ACM
15 years 4 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
85
Voted
ATAL
2003
Springer
15 years 4 months ago
2003
Springer
The emerging science of simulation enables us to explore the dynamics of large and complex systems even if a formal representation and analysis of the system is intractable and a ...
111
click to vote
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...