6894 search results - page 250 / 1379 » Generation Problems |
179
Voted
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
184
click to vote
INLG
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We present a new approach to the generation of referring expressions containing attributive, type and relational properties combined by conjunctions, disjunctions and neg...
138
click to vote
ICANN
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. Dynamic neural filters (DNFs) are recurrent networks of binary neurons. Under proper conditions of their synaptic matrix they are known to generate exponentially large c...
165
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
We reduce the state explosion problem in automatic verification of finite-state systems by automatically collapsing subgraphs of the aph into abstract states. The key idea of the ...
158
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
We examine frequency-domain issues in the design and selection of on-chip test generators for built-in self-test (BIST) of highperformance digital filters. Test-generator/circuit...