Sciweavers

963 search results - page 88 / 193
» On the decomposition of rational functions
Sort
View
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
13 years 8 months ago
Airy Phenomena and Analytic Combinatorics of Connected Graphs
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
Philippe Flajolet, Bruno Salvy, Gilles Schaeffer
IAW
2003
IEEE
14 years 2 months ago
Static Verification of Worm and virus Behavior in binary Executables using Model Checking
- Use offormal methods in any application scenario requires a precise characterization and representation of the properties that need to be verified The target, which is desired ri...
Prabhat K. Singh, Arun Lakhotia
ICCAD
1996
IEEE
123views Hardware» more  ICCAD 1996»
14 years 1 months ago
Efficient solution of systems of Boolean equations
This paper describes an algorithm for the efficient solution of large systems of Boolean equations. The algorithm exploits the fact that, in some cases, the composition operation ...
Scott Woods, Giorgio Casinovi
CORR
2002
Springer
106views Education» more  CORR 2002»
13 years 8 months ago
On model selection and the disability of neural networks to decompose tasks
A neural network with fixed topology can be regarded as a parametrization of functions, which decides on the correlations between functional variations when parameters are adapted...
Marc Toussaint
TPHOL
2000
IEEE
14 years 12 days ago
Equational Reasoning via Partial Reflection
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg