Sciweavers

217 search results - page 24 / 44
» Deterministic Algorithm for the t-Threshold Set Problem
Sort
View
AI
1999
Springer
13 years 7 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
DATE
2007
IEEE
88views Hardware» more  DATE 2007»
14 years 2 months ago
Trade-off design of analog circuits using goal attainment and "Wave Front" sequential quadratic programming
One of the main tasks in analog design is the sizing of the circuit parameters, such as transistor lengths and widths, in order to obtain optimal circuit performances, such as hig...
Daniel Mueller, Helmut E. Graeb, Ulf Schlichtmann
ICS
2010
Tsinghua U.
13 years 11 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
DFT
2003
IEEE
64views VLSI» more  DFT 2003»
14 years 1 months ago
Hybrid BIST Time Minimization for Core-Based Systems with STUMPS Architecture
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
Gert Jervan, Petru Eles, Zebo Peng, Raimund Ubar, ...
TCBB
2008
126views more  TCBB 2008»
13 years 7 months ago
Combinatorial Approaches for Mass Spectra Recalibration
Mass spectrometry has become one of the most popular analysis techniques in Proteomics and Systems Biology. With the creation of larger data sets, the automated recalibration of ma...
Sebastian Böcker, Veli Mäkinen