Sciweavers

3838 search results - page 23 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
APN
2001
Springer
15 years 8 months ago
Optimising Enabling Tests and Unfoldings of Algebraic System Nets
Reachability analysis and simulation tools for high-level nets spend a significant amount of the computing time in performing enabling tests, determining the assignments under whi...
Marko Mäkelä
121
Voted
SPLC
2008
15 years 4 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
171
Voted
PPOPP
2011
ACM
14 years 6 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
ACSD
2008
IEEE
135views Hardware» more  ACSD 2008»
15 years 5 months ago
Synthesis of Petri nets from infinite partial languages
In this paper we present an algorithm to synthesize a finite unlabeled place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term ove...
Robin Bergenthum, Jörg Desel, Robert Lorenz, ...
142
Voted
IICAI
2003
15 years 4 months ago
The Acyclic Bayesian Net Generator
Abstract. We present the Acyclic Bayesian Net Generator, a new approach to learn the structure of a Bayesian network using genetic algorithms. Due to the encoding mechanism, acycli...
Pankaj B. Gupta, Vicki H. Allan