Sciweavers

11151 search results - page 379 / 2231
» On the Complexity of Model Expansion
Sort
View
CP
1998
Springer
15 years 11 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
ICPR
2010
IEEE
15 years 11 months ago
Monogenic Binary Pattern (MBP): A Novel Feature Extraction and Representation Model for Face Recognition
A novel feature extraction method, namely monogenic binary pattern (MBP), is proposed in this paper based on the theory of monogenic signal analysis, and the histogram of MBP (HMB...
Meng Yang, Lei Zhang, Lin Zhang, David Zhang
TIT
2010
105views Education» more  TIT 2010»
15 years 2 months ago
DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models
The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT),...
Joakim Jalden, Petros Elia
ECBS
2011
IEEE
271views Hardware» more  ECBS 2011»
14 years 7 months ago
MoPED: A Model-Based Provisioning Engine for Dependability in Component-Based Distributed Real-Time Embedded Systems
—Developing dependable distributed real-time and embedded (DRE) systems incurs significant complexities in the tradeoffs resulting from the different conflicting attributes of ...
Sumant Tambe, Akshay Dabholkar, Aniruddha S. Gokha...
FCT
2007
Springer
16 years 1 months ago
A String-Based Model for Simple Gene Assembly
Abstract. The simple intramolecular model for gene assembly in ciliates is particularly interesting because it can predict the correct assembly of all available experimental data, ...
Robert Brijder, Miika Langille, Ion Petre