Sciweavers

13603 search results - page 2718 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
ISSTA
2000
ACM
13 years 11 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
13 years 11 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
ICML
1999
IEEE
13 years 11 months ago
Learning Hierarchical Performance Knowledge by Observation
Developing automated agents that intelligently perform complex real world tasks is time consuming and expensive. The most expensive part of developing these intelligent task perfo...
Michael van Lent, John E. Laird
SMA
1999
ACM
107views Solid Modeling» more  SMA 1999»
13 years 11 months ago
Generation of swept volumes of toroidal endmills in five-axis motion using space curves
Accurate prediction of the swept volume of a cutting tool is essential in NC verification algorithms for detecting deficiencies in a proposed tool path, such as gouging, undercutt...
David Roth, Sanjeev Bedi, Fathy Ismail
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
13 years 11 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
« Prev « First page 2718 / 2721 Last » Next »