Sciweavers

4192 search results - page 256 / 839
» Efficient testing of groups
Sort
View
CORR
2011
Springer
145views Education» more  CORR 2011»
15 years 18 days ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
157
Voted
SIAMSC
2011
113views more  SIAMSC 2011»
15 years 2 days ago
An Efficient Higher-Order Fast Multipole Boundary Element Solution for Poisson-Boltzmann-Based Molecular Electrostatics
In order to compute polarization energy of biomolecules, we describe a boundary element approach to solving the linearized Poisson–Boltzmann equation. Our approach combines sever...
Chandrajit L. Bajaj, Shun-Chuan Albert Chen, Alexa...
DAC
1994
ACM
15 years 9 months ago
Dynamic Search-Space Pruning Techniques in Path Sensitization
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
João P. Marques Silva, Karem A. Sakallah
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
15 years 9 months ago
Modeling Urgency in Component-Based Real-Time Systems
A component-based realtime system is a simple model for the server-client relation with time constraints. This paper presents an efficient algorithm, called a blackbox testing algo...
Nguyen Van Tang, Dang Van Hung, Mizuhito Ogawa
ESANN
2003
15 years 7 months ago
Comparison of neural algorithms for blind source separation in sensor array applications
- A test bed of experiments with real and artificially generated data has been designed to compare the performance of three well-known algorithms for BSS. The main goal of these ex...
Guillermo Bedoya, Sergio Bermejo, Joan Cabestany