Sciweavers

937 search results - page 4 / 188
» On the Complexity of Partial Order Properties
Sort
View
ORDER
2002
104views more  ORDER 2002»
14 years 9 months ago
Partially Well-Ordered Closed Sets of Permutations
It is known that the "pattern containment" order on permutations is not a partial well-order. Nevertheless, many naturally defined subsets of permutations are partially ...
Mike D. Atkinson, Max Murphy, Nikola Ruskuc
TAMC
2010
Springer
15 years 1 months ago
Binary De Bruijn Partial Words with One Hole
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...
Francine Blanchet-Sadri, Jarett Schwartz, Slater S...
FSTTCS
1998
Springer
15 years 2 months ago
Partial Order Reductions for Bisimulation Checking
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
Michaela Huhn, Peter Niebert, Heike Wehrheim
HYBRID
1998
Springer
15 years 2 months ago
High Order Eigentensors as Symbolic Rules in Competitive Learning
We discuss properties of high order neurons in competitive learning. In such neurons, geometric shapes replace the role of classic `point' neurons in neural networks. Complex ...
Hod Lipson, Hava T. Siegelmann
CP
2004
Springer
15 years 3 months ago
Generating Robust Partial Order Schedules
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A...