Sciweavers

17541 search results - page 3123 / 3509
» Complexity in scalable computing
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 7 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...
COMCOM
2008
91views more  COMCOM 2008»
15 years 7 months ago
A WEP post-processing algorithm for a Robust 802.11 WLAN implementation
Wired Equivalent Privacy (WEP) protocol used within the IEEE 802.11 standard has "major security flaws" thus wireless local area networks (WLANs) using the protocol are ...
Taskin Koçak, Mohit Jagetia
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 7 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
CONCURRENCY
2008
127views more  CONCURRENCY 2008»
15 years 7 months ago
gLite Job Provenance - a job-centric view
ct Job Provenance (JP) is a Grid service that keeps long-term trace on completed computations for further reference. It is a job-centric service, keeping records about job life cyc...
Ales Krenek, Jirí Sitera, Ludek Matyska, Fr...
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 7 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts
« Prev « First page 3123 / 3509 Last » Next »