Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,979,792 papers from all fields of science
Search
Sign In
Create Free Account
S-graph
The S-graph framework is an approach to solving batch process scheduling problems in chemical plants. S-graph is suited for the problems with a non…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
1 relation
Algorithm
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Tree-to-Graph Transductions with Scope
Johanna Björklund
International Conference on Developments in…
2018
Corpus ID: 52148592
High-level natural language processing requires formal languages to represent semantic information. A recent addition of this…
Expand
2017
2017
Post-silicon observability enhancement with topology based trace signal selection
Binod Kumar
,
Ankit Jindal
,
M. Fujita
,
Virendra Singh
Latin American Test Symposium
2017
Corpus ID: 12445646
Selection of trace signals for an effective post-silicon validation and debug process is a challenging problem. State restoration…
Expand
2015
2015
Semantic construction with graph grammars
Alexander Koller
International Conference on Computational…
2015
Corpus ID: 17428569
We introduce s-graph grammars, a new grammar formalism for computing graph-based semantic representations. Semantically annotated…
Expand
2012
2012
Formalizing and Implementing Multi-Result Supercompilation ⋆
I. Klyuchnikov
,
S. Romanenko
2012
Corpus ID: 9247744
The paper explains the principles of multi-result supercom- pilation. We introduce a formalism for representing supercompilation…
Expand
2011
2011
Study of Shortest Path Based on Weighted Identification S-graph
A-ning Liu
2011
Corpus ID: 124746148
In order to solve the intelligent transportation system in transportation network analysis and the shortest path problem,this…
Expand
2010
2010
S-graph Based Scheduling Method for Parallel Architecture
J. Smidla
,
I. Heckl
2010
Corpus ID: 54736619
The S-graph framework introduced by Sanmarti et al. (1998), originally developed for single processor, is proved to be an…
Expand
2005
2005
Measuring the Propagation of Information in Partial Evaluation
H. Rohde
2005
Corpus ID: 17185715
We present the first measurement-based analysis of the information propagated by a partial evaluator. Our analysis is based on…
Expand
1993
1993
A Unification-Based Parser for Relational Grammar
David E. Johnson
,
Adam Meyers
,
L. Moss
Annual Meeting of the Association for…
1993
Corpus ID: 6988867
We present an implemented unification-based parser for relational grammars developed within the stratified feature grammar (SFG…
Expand
1993
1993
Partial Scan with Retiming
D. Kagaris
,
S. Tragoudas
30th ACM/IEEE Design Automation Conference
1993
Corpus ID: 5474596
A generally effective approach to the partial scan problem is to select flip-flops that break the cyclic structure of the circuit…
Expand
1986
1986
Controlled Active Procedures as a Tool for Linguistic Engineering
H. Luckhardt
,
Manfred Thiel
International Conference on Computational…
1986
Corpus ID: 5249485
Controlled active procedures are productions that are grouped under and activated by units called 'scouts'. Scouts are controlled…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE