Sciweavers

866 search results - page 152 / 174
» On Dynamic Shortest Paths Problems
Sort
View
JNW
2006
68views more  JNW 2006»
13 years 9 months ago
Quick Local Repair Scheme using Adaptive Promiscuous Mode in Mobile Ad Hoc Networks
In mobile ad hoc networks (MANETs), there is frequently disconnected a route consisting of multi-hop from a source to a destination because of the dynamic nature such as the topolo...
Joo Sang Youn, Jihoon Lee, Doo-Hyun Sung, Chul-Hee...
COMCOM
2004
90views more  COMCOM 2004»
13 years 9 months ago
Understanding bandwidth-delay product in mobile ad hoc networks
Bandwidth-delay product (BDP) and its upper bound (BDP-UB) have been well-understood in wireline networks such as the Internet. However, they have not been carefully studied in th...
Kai Chen, Yuan Xue, Samarth H. Shah, Klara Nahrste...
WSC
2000
13 years 11 months ago
Using simulation and critical points to define states in continuous search spaces
Many artificial intelligence techniques rely on the notion ate" as an abstraction of the actual state of the nd an "operator" as an abstraction of the actions that ...
Marc S. Atkin, Paul R. Cohen
BMCBI
2005
158views more  BMCBI 2005»
13 years 9 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
EUROSYS
2011
ACM
13 years 1 months ago
Striking a new balance between program instrumentation and debugging time
Although they are helpful in many cases, state-of-the-art bug reporting systems may impose excessive overhead on users, leak private information, or provide little help to the dev...
Olivier Crameri, Ricardo Bianchini, Willy Zwaenepo...