Sciweavers

1127 search results - page 82 / 226
» New Algorithms for Generalized Network Flows
Sort
View
INFOCOM
2000
IEEE
15 years 2 months ago
Scalable TCP Congestion Control
— The packet losses imposed by IP networks can cause long and erratic recovery delays, since senders must often use conservative loss detection and retransmission mechanisms. Thi...
Robert Morris
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
15 years 10 months ago
The price of anarchy is independent of the network topology
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
Tim Roughgarden
MOBIHOC
2003
ACM
15 years 10 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
DAC
2006
ACM
15 years 11 months ago
State encoding of large asynchronous controllers
A novel method to solve the state encoding problem in Signal Transition Graphs is presented. It is based on the structural theory of Petri nets and can be applied to large specifi...
Josep Carmona, Jordi Cortadella
SIGSOFT
2003
ACM
15 years 11 months ago
Context-sensitive slicing of concurrent programs
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...
Jens Krinke