Sciweavers

4110 search results - page 402 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
157
Voted
ET
2002
97views more  ET 2002»
15 years 6 months ago
Test Generation for Crosstalk-Induced Faults: Framework and Computational Results
Due to technology scaling and increasing clock frequency, problems due to noise effects lead to an increase in design/debugging efforts and a decrease in circuit performance. This...
Wei-Yu Chen, Sandeep K. Gupta, Melvin A. Breuer
JAR
2002
72views more  JAR 2002»
15 years 6 months ago
Partial Instantiation Methods for Inference in First-Order Logic
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
John N. Hooker, G. Rago, V. Chandru, A. Shrivastav...
ICMLA
2010
15 years 4 months ago
Multimodal Parameter-exploring Policy Gradients
Abstract-- Policy Gradients with Parameter-based Exploration (PGPE) is a novel model-free reinforcement learning method that alleviates the problem of high-variance gradient estima...
Frank Sehnke, Alex Graves, Christian Osendorfer, J...
CSCLP
2007
Springer
16 years 29 days ago
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
Pavel Surynek
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 11 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...