Sciweavers

1883 search results - page 214 / 377
» Ordered theta graphs
Sort
View
VLSID
1994
IEEE
113views VLSI» more  VLSID 1994»
14 years 8 days ago
A Methodology for Architecture Synthesis of Cascaded IIR Filters on TLU FPGAs
In this paper, we propose an architecture synthesis methodolog `to realize cascaded Infinite Impulse Response (IIRJfilter in Table Look Up (TLU) Field Progmmmable Gate A m y s (FP...
G. N. Rathna, S. K. Nandy, K. Parthasarathy
ESANN
2006
13 years 9 months ago
Using Regression Error Characteristic Curves for Model Selection in Ensembles of Neural Networks
Regression Error Characteristic (REC) analysis is a technique for evaluation and comparison of regression models that facilitates the visualization of the performance of many regre...
Aloísio Carlos de Pina, Gerson Zaverucha
AAAI
1994
13 years 9 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter
AUTOMATICA
2010
130views more  AUTOMATICA 2010»
13 years 8 months ago
Discrete-time dynamic average consensus
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
Minghui Zhu, Sonia Martínez
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 8 months ago
A Note on the Number of Hamiltonian Paths in Strong Tournaments
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
Arthur H. Busch