17967 search results - page 316 / 3594 » Functional timing optimization |
162
click to vote
FCS
2006
15 years 8 months ago
2006
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
178
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Our human body is well protected by antibodies from our biological immune system. This protection system matured over millions of years and has proven its functionality. In our re...
211
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
154
Voted
DAC
2004
ACM
16 years 7 months ago
2004
ACM
We present a set of techniques for placement-coupled, timingdriven logic replication. Two components are at the core of the approach. First is an algorithm for optimal timingdrive...
173
click to vote
ROBOCUP
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...