Sciweavers

3598 search results - page 326 / 720
» New efficient algorithms for computing effective capacitance
Sort
View
ICCD
2008
IEEE
151views Hardware» more  ICCD 2008»
16 years 3 months ago
Digital filter synthesis considering multiple adder graphs for a coefficient
—In this paper, a new FIR digital filter synthesis algorithm is proposed to consider multiple adder graphs for a coefficient. The proposed algorithm selects an adder graph that c...
Jeong-Ho Han, In-Cheol Park
FM
2008
Springer
148views Formal Methods» more  FM 2008»
15 years 8 months ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl
AAAI
2006
15 years 8 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
EOR
2010
110views more  EOR 2010»
15 years 6 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
CGF
2008
139views more  CGF 2008»
15 years 6 months ago
CHC++: Coherent Hierarchical Culling Revisited
We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of te...
Oliver Mattausch, Jirí Bittner, Michael Wim...