Sciweavers

11328 search results - page 121 / 2266
» Timed Branching Processes
Sort
View
DATE
2004
IEEE
106views Hardware» more  DATE 2004»
15 years 7 months ago
Realizable Reduction for Electromagnetically Coupled RLMC Interconnects
This paper presents a realizable RLMC1 reduction algorithm for extracted interconnect circuits based on two effective approaches: RL branch reduction and RC/LC node reduction. Our...
Rong Jiang, Charlie Chung-Ping Chen
TACAS
2000
Springer
139views Algorithms» more  TACAS 2000»
15 years 7 months ago
A Markov Chain Model Checker
Markov chains are widely used in the context of performance and reliability evaluation of systems of various nature. Model checking of such chains with respect to a given (branchin...
Holger Hermanns, Joost-Pieter Katoen, Joachim Meye...
118
Voted
FLAIRS
2006
15 years 4 months ago
A Hill-Climbing Approach for Planning with Temporal Uncertainty
We present a hill-climbing algorithm to solve planning problems with temporal uncertainty. First an optimistic plan that is valid when all actions complete quickly is found. Then ...
Janae N. Foss, Nilufer Onder
JGTOOLS
2008
109views more  JGTOOLS 2008»
15 years 3 months ago
Fast Equal-Area Mapping of the (Hemi)Sphere using SIMD
We present a fast vectorized implementation of a transform that maps points in the unit square to the surface of the sphere, while preserving fractional area. The mapping uses the ...
Petrik Clarberg
PKC
2011
Springer
212views Cryptology» more  PKC 2011»
14 years 6 months ago
On the Correct Use of the Negation Map in the Pollard rho Method
Bos, Kaihara, Kleinjung, Lenstra, and Montgomery recently showed that ECDLPs on the 112-bit secp112r1 curve can be solved in an expected time of 65 years on a PlayStation 3. This p...
Daniel J. Bernstein, Tanja Lange, Peter Schwabe