Sciweavers

380 search results - page 55 / 76
» Towards an Optimal Routing Strategy
Sort
View
GLOBECOM
2008
IEEE
14 years 2 months ago
Optimal Location Updates in Mobile Ad Hoc Networks: A Separable Cost Case
Abstract—We consider the location service in a mobile adhoc network (MANET), where each node needs to maintain its location information in the network by (i) frequently updating ...
Zhenzhen Ye, Alhussein A. Abouzeid
TOPNOC
2008
13 years 8 months ago
Directed Unfolding of Petri Nets
The key to efficient on-the-fly reachability analysis based on unfolding is to focus the expansion of the finite prefix towards the desired marking. However, current unfolding stra...
Blai Bonet, Patrik Haslum, Sarah L. Hickmott, Sylv...
MOBICOM
2006
ACM
14 years 2 months ago
Component based channel assignment in single radio, multi-channel ad hoc networks
In this paper, we consider the channel assignment problem in single radio multi-channel mobile ad-hoc networks. Specifically, we investigate the granularity of channel assignment...
Ramanuja Vedantham, Sandeep Kakumanu, Sriram Laksh...
FPGA
2004
ACM
126views FPGA» more  FPGA 2004»
14 years 1 months ago
A synthesis oriented omniscient manual editor
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...
Tomasz S. Czajkowski, Jonathan Rose
TLCA
2005
Springer
14 years 1 months ago
Call-by-Name and Call-by-Value as Token-Passing Interaction Nets
Two common misbeliefs about encodings of the λ-calculus in interaction nets (INs) are that they are good only for strategies that are not very well understood (e.g. optimal reduct...
François-Régis Sinot