Sciweavers

301 search results - page 5 / 61
» An efficient algorithm to verify generalized false paths
Sort
View
WWW
2004
ACM
14 years 9 months ago
SPT-based topology algorithm for constructing power efficient wireless ad hoc networks
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
Szu-Chi Wang, David S. L. Wei, Sy-Yen Kuo
WSC
2004
13 years 9 months ago
Efficient Pricing of Barrier Options with the Variance-Gamma Model
We develop an efficient Monte Carlo algorithm for pricing barrier options with the variance gamma model (Madan, Carr, and Chang 1998). After generalizing the double-gamma bridge s...
Athanassios N. Avramidis
POPL
2010
ACM
14 years 5 months ago
A simple, verified validator for software pipelining
Software pipelining is a loop optimization that overlaps the execution of several iterations of a loop to expose more instruction-level parallelism. It can result in first-class p...
Jean-Baptiste Tristan, Xavier Leroy
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 8 months ago
Approximation Algorithms for Shortest Descending Paths in Terrains
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw...
APPT
2007
Springer
14 years 2 months ago
An Efficient Construction of Node Disjoint Paths in OTIS Networks
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
Weidong Chen, Wenjun Xiao, Behrooz Parhami