Sciweavers

145 search results - page 6 / 29
» Transient Probability Functions: A Sample Path Approach
Sort
View
ISSS
1999
IEEE
157views Hardware» more  ISSS 1999»
14 years 1 months ago
Bit-Width Selection for Data-Path Implementations
Specifications of data computations may not necessarily describe the ranges of the intermediate results that can be generated. However, such information is critical to determine t...
Carlos Carreras, Juan A. López, Octavio Nie...
GECCO
2010
Springer
162views Optimization» more  GECCO 2010»
14 years 1 months ago
Heuristics for sampling repetitions in noisy landscapes with fitness caching
For many large-scale combinatorial search/optimization problems, meta-heuristic algorithms face noisy objective functions, coupled with computationally expensive evaluation times....
Forrest Stonedahl, Susa H. Stonedahl
COSIT
2009
Springer
159views GIS» more  COSIT 2009»
14 years 3 months ago
Adaptable Path Planning in Regionalized Environments
Human path planning relies on several more aspects than only geometric distance between two locations. These additional aspects mostly relate to the complexity of the traveled path...
Kai-Florian Richter
BMCBI
2005
121views more  BMCBI 2005»
13 years 9 months ago
Evaluation of gene importance in microarray data based upon probability of selection
Background: Microarray devices permit a genome-scale evaluation of gene function. This technology has catalyzed biomedical research and development in recent years. As many import...
Li M. Fu, Casey S. Fu-Liu
DAC
2002
ACM
14 years 10 months ago
A general probabilistic framework for worst case timing analysis
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...
Michael Orshansky, Kurt Keutzer