Results 261 to 270 of about 4,792,487 (297)
Some of the next articles are maybe not open access.
Structural Tractability of Propagated Constraints
2008Modern 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 +1 more
openaire +1 more source
Structural Constraints in Rich Hypertexts
1996For 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 +2 more sources
Structural Constraints on Residue Substitution
1992Protein 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
2018This 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
Structure of rings with polynomial constraints
1985Let Z denote the ring of integers. Let A denote a non-empty subset of a ring R and consider the following ring properties: (I-A) for each \(x\in R\) there exists p(X) in Z[X] for which \(x-x^ 2p(x)\in A\); (II-A) if x,y\(\in R\) and x-y\(\in A\), then either \(x^ 2=y^ 2\) or x and y both centralize A. The authors establish that each of the following is
CHERUBINI, ALESSANDRA, VARISCO, ADA
openaire +2 more sources
Information Structure Constraints
2009Large-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ć +1 more
openaire +1 more source
Information Structure Constraints
2007Abstract The purpose of this chapter is to show that the processing of information structure plays an important role with respect to constraints which have traditionally been viewed as syntactic constraints. The first section demonstrates that word order in simple sentences is constrained by the need to avoid an ambiguous parse of the ...
openaire +1 more source
Processing Structural Constraints
2009When searching unstructured plain-text the user is limited in the expressive power of their query – they can only ask for documents that are about something. When structure is present in the document, and with a query language that supports its use, the user is able to write far more precise queries.
openaire +1 more source