Results 261 to 270 of about 340,966 (303)

Structural Constraints in Rich Hypertexts

1996
For hypertext to be successful in the area of software engineering, it is necessary to have tools that can manipulate a hypertext of typed nodes, links, and composites. In several systems it is possible to define new application specific types. The type of a hypertext entity will be used to model the role of the entity in the overall hypertext. As part
openaire   +1 more source

Structural Tractability of Propagated Constraints

2008
Modern constraint solvers do not require constraints to be represented using any particular data structure. Instead, constraints are given as black boxes known as propagators. Propagators are given a list of current domains for variables and are allowed to prune values not consistent with these current domains.
Martin James Green, Christopher Jefferson   +1 more
openaire   +1 more source

Constraint Representations and Structural Tractability

2009
The intractability of the general CSP has motivated the search for restrictions which lead to tractable fragments. One way to achieve tractability is to restrict the structure of the instances. As much of the work in this area arises from similar work on databases it has been a natural assumption that all constraint relations are explicitly represented.
David A. Cohen, Martin James Green, Chris Houghton   +2 more
openaire   +1 more source

Random Constraint Satisfaction: Flaws and Structure

Constraints, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ian P. Gent, Ewan MacIntyre, Patrick Prosser, Barbara M. Smith, Toby Walsh   +4 more
openaire   +2 more sources

Constraints on Structural Descriptions: Local Transformations

SIAM Journal on Computing, 1977
It is very often more convenient and more meaningful to specify a set of structural descriptions analytically rather than generatively, i.e., by specifying a set of constraints each structured description in the set has to satisfy. Peters and Ritchie [7] have shown that if context-sensitive rules are used only for “analysis” then the string language of
Aravind K. Joshi, Leon S. Levy
openaire   +2 more sources

Constraint Analysis and Structure Identification

1976
Recent developments in establishing a firm conceptual foundation for a systems methodology by Klir (1975) have revealed a differentiation of system definitions in the form of a hierarchy. This paper concentrates on a specific hierarchical level which is concerned with the structure identification problem. It is shown that the application of information
openaire   +2 more sources

Structural Constraints on Residue Substitution

1992
Protein sequences are clearly grouped into families related by evolution. Divergence of protein sequences proceeds by random mutation at the gene level and natural selection at the level of protein structure and function. It is well established that the protein folding “code” is highly degenerate, in that many different sequences (for example, less ...
openaire   +2 more sources

Constraints on Argument Structure

2018
This chapter suggests preliminary responses to problems that came up during our presentation at the Cornell Symposium on Syntactic Theory and First Language Acquisition. Research by a number of linguists has revealed certain rather striking facts concerning the fundamental nature of the argument structures determined by individual lexical items.
Kenneth Hale, Samuel Jay Keyser
openaire   +1 more source

Computational Solutions for Structural Constraints

2001
The need to solve structural constraints arises when we investigate computational solutions to the question: "in which logics is a given formula deducible?" This question is posed when one wants to learn the structural permissions for a Categorial Grammar deduction.
openaire   +1 more source

Information Structure Constraints

2009
Large-scale systems require control laws whose computation is efficient, and whose implementation entails a minimal amount of information exchange between the subsystems. In order to design such laws, it is necessary to develop versatile algorithms that can incorporate a broad range of information structure constraints.
Aleksandar I. Zečević, Dragoslav D. Šiljak   +1 more
openaire   +1 more source