Sciweavers

1929 search results - page 5 / 386
» An Approach to Limit the Wynot Problem
Sort
View
DATE
2000
IEEE
92views Hardware» more  DATE 2000»
14 years 6 days ago
An Efficient Heuristic Approach to Solve the Unate Covering Problem
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
Roberto Cordone, Fabrizio Ferrandi, Donatella Sciu...
BC
2006
105views more  BC 2006»
13 years 8 months ago
A stochastic population approach to the problem of stable recruitment hierarchies in spiking neural networks
Recruitment learning in hierarchies is an inherently unstable process (Valiant, 1994). This paper presents conditions on parameters for a feedforward network to ensure stable recru...
Cengiz Günay, Anthony S. Maida
ALT
2003
Springer
14 years 7 days ago
Can Learning in the Limit Be Done Efficiently?
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
Thomas Zeugmann
IJCAI
2003
13 years 10 months ago
Approximating Optimal Policies for Agents with Limited Execution Resources
An agent with limited consumable execution resources needs policies that attempt to achieve good performance while respecting these limitations. Otherwise, an agent (such as a pla...
Dmitri A. Dolgov, Edmund H. Durfee
JCAM
2010
116views more  JCAM 2010»
13 years 3 months ago
A vertex-based hierarchical slope limiter for p-adaptive discontinuous Galerkin methods
A new approach to slope limiting for discontinuous Galerkin methods on arbitrary meshes is introduced. A local Taylor basis is employed to express the approximate solution in term...
Dmitri Kuzmin