Sciweavers

969 search results - page 194 / 194
» Recursive Petri nets
Sort
View
STACS
2007
Springer
13 years 11 months ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 5 months ago
Mining for misconfigured machines in grid systems
Grid systems are proving increasingly useful for managing the batch computing jobs of organizations. One well known example for that is Intel which uses an internally developed sy...
Noam Palatin, Arie Leizarowitz, Assaf Schuster, Ra...
ICCAD
2003
IEEE
117views Hardware» more  ICCAD 2003»
14 years 2 months ago
On Whitespace and Stability in Mixed-Size Placement and Physical Synthesis
In the context of physical synthesis, large-scale standard-cell placement algorithms must facilitate incremental changes to layout, both local and global. In particular, flexible...
Saurabh N. Adya, Igor L. Markov, Paul Villarrubia
CPAIOR
2009
Springer
14 years 1 days ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin