Sciweavers

206 search results - page 28 / 42
» Three Hoppy path problems and ternary paths
Sort
View
IEEEPACT
2003
IEEE
15 years 5 months ago
Resolving Register Bank Conflicts for a Network Processor
This paper discusses a register bank assignment problem for a popular network processor--Intel's IXP. Due to limited data paths, the network processor has a restriction that ...
Xiaotong Zhuang, Santosh Pande
ADHOC
2011
14 years 6 months ago
Evaluation and design of beaconing in mobile wireless networks
One of the intrinsic problems of mobility in wireless networks is the discovery of mobile nodes. A widely used solution for this problem is to use different variations of beacons, ...
Abbas Nayebi, Gunnar Karlsson, Hamid Sarbazi-Azad
96
Voted
LICS
2006
IEEE
15 years 5 months ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong
PAM
2005
Springer
15 years 5 months ago
Internet Routing Policies and Round-Trip-Times
Abstract. Round trip times (RTTs) play an important role in Internet measurements. In this paper, we explore some of the ways in which routing policies impact RTTs. In particular, ...
Han Zheng, Eng Keong Lua, Marcelo Pias, Timothy G....
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
14 years 10 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...