Sciweavers

1618 search results - page 133 / 324
» Testing random number generators
Sort
View
DAC
1994
ACM
14 years 2 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
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
14 years 5 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002
IJCAI
2001
13 years 11 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
ICTAI
2008
IEEE
14 years 4 months ago
An Incremental Hough Transform for Detecting Ellipses in Image Data Streams
In this paper, we present a purely incremental, scalable algorithm for the detection of elliptical shapes in images. Our method uses an incremental version of the Random Hough Tra...
Sofiane Sellah, Olfa Nasraoui
SIAMSC
2010
134views more  SIAMSC 2010»
13 years 8 months ago
Moving Least Squares via Orthogonal Polynomials
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient ...
Michael Carley