Sciweavers

2070 search results - page 139 / 414
» A Reduced-Basis Element Method
Sort
View
ANTS
2004
Springer
233views Algorithms» more  ANTS 2004»
15 years 9 months ago
Computing Order Statistics in the Farey Sequence
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
Corina E. Patrascu, Mihai Patrascu
GECCO
2004
Springer
15 years 9 months ago
Non-stationary Subtasks Can Improve Diversity in Stationary Tasks
Low diversity in a genetic algorithm (GA) can cause the search to become stagnant upon reaching a local optimum. To some extent, non-stationary tasks avoid this problem, which woul...
Christopher Willis-Ford, Terence Soule
ISQED
2000
IEEE
91views Hardware» more  ISQED 2000»
15 years 8 months ago
Probabilistic Bottom-Up RTL Power Estimation
We address the problem of power estimation at the register-transfer level (RTL). At this level, the circuit is described in terms of a set of interconnected memory elements and co...
Ricardo Ferreira, A.-M. Trullemans, José C....
ICRA
1999
IEEE
96views Robotics» more  ICRA 1999»
15 years 8 months ago
Telemetric Robot Skin
Human-friendly robots of new generation will require the sensor skin that is soft and covering the whole body. But it would be very difficult to fabricate it with the traditional ...
Mitsuhiro Hakozaki, Hideki Oasa, Hiroyuki Shinoda
138
Voted
PVM
1999
Springer
15 years 8 months ago
Parallel Monte Carlo Algorithms for Sparse SLAE Using MPI
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
Vassil N. Alexandrov, Aneta Karaivanova