A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Predicates whose maximal length functions increase periodically
1990
Discrete Mathematics
Preserved Fulltext
For such predicates we say that L, increases periodically. ...
In particular, we show that if D is a finite set of tuples of positive integers, then L, increases periodically for the predicate P = "X contains an s-tuple {ai}: with {a,+l -a,};-' m D". ...
We call Lp the maximal length function for the predicate P. ...
doi:10.1016/0012-365x(90)90268-m
fatcat:gejmwcgptnd5tncvlsfnehd6se
Page 6431 of Mathematical Reviews Vol. , Issue 91M
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
An example of a predicate whose maximal length function does not increase periodically is Q: X contains an element which is not a power of 2. ...
Anne Ludington Young (Baltimore, MD)
91m:11014 11B83 05B10
Gilpin, Michael [Gilpin, Michael J.] (1-MITU);
Shelton, Robert (1-MITU)
Predicates whose maximal length functions increase periodically. ...
Author index volume 84 (1990)
1990
Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Shelton, Predicates whose maximal length functions increase periodically Giraud, G.R., Remarques sur deux problems extremaux (Note) Goldman, A. J., see Robinson, A.B. and 0. ...
doi:10.1016/0012-365x(90)90141-4
fatcat:hp5bwqzx3bapnmbeavvedpysma
Temporal Support for Persistent Stored Modules
2012
2012 IEEE 28th International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To support sequenced evaluation of stored functions and procedures, we define two different slicing approaches, maximal slicing and per-statement slicing. ...
Our approach requires minor new syntax beyond that already in SQL/Temporal to define and to invoke PSM procedures and functions, thereby extending the current, sequenced, and non-sequenced semantics of ...
If another function is called inside a function, the constant period passed into the original function is also passed into the Figure 1 using maximally-fragmented slicing nested function. ...
doi:10.1109/icde.2012.70
dblp:conf/icde/SnodgrassGZT12
fatcat:zs6nsudozvcrvi4wxnpxdbqplm
Exploiting functional dependencies in declarative problem specifications
2007
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we tackle the issue of the automatic recognition of functional dependencies among guessed predicates in constraint problem specifications. ...
modelling choices, e.g., to provide multiple viewpoints of the search space in order to increase propagation. ...
Moreover, in those cases in which functional dependencies derive from the adoption of multiple viewpoints of the search space, we could choose the best maximal set of independent predicates to branch on ...
doi:10.1016/j.artint.2007.04.017
fatcat:fqoe5wj5cnarlnjm3kfjlbrqxi
Exploiting Functional Dependencies in Declarative Problem Specifications
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we tackle the issue of the automatic recognition of functional dependencies among guessed predicates in constraint problem specifications. ...
modelling choices, e.g., to provide multiple viewpoints of the search space in order to increase propagation. ...
Moreover, in those cases in which functional dependencies derive from the adoption of multiple viewpoints of the search space, we could choose the best maximal set of independent predicates to branch on ...
doi:10.1007/978-3-540-30227-8_52
fatcat:bgfyuazwrncbbmwwhmzcgjdoka
A new efficient retiming algorithm derived by formal manipulation
2008
ACM Transactions on Design Automation of Electronic Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Contrary to all previous algorithms, which used fixed period feasibility checking to binary-search a candidate range, the derived algorithm checks the optimality of a feasible period directly. ...
A new efficient algorithm is derived for the minimal period retiming by formal manipulation. ...
Recent progress on semiconductor technology saw an increase on the number of global wires whose delays are longer than one clock period [Hassoun and Alpert 2002; Cocchini 2002] , and retiming is again ...
doi:10.1145/1297666.1297673
fatcat:52oc342pcrewncbb4gf6mktkqe
Spatial and Spatio-Temporal Data Models and Languages
[chapter]
2009
Encyclopedia of Database Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the context of complex objects like video, genomic, and multimedia objects, a data model describes a type system consisting of data types, operations, and predicates. ...
Due to the increasing success of relational databases, the first approach has been to decompose a spatial object recursively into its constituent parts until they can be stored in tables. ...
The operation length is a numerical function computing the length of a line object. The operation intersection computes the part of a line object intersecting a region object. ...
doi:10.1007/978-0-387-39940-9_360
fatcat:q226mutirbetxaqzucp3hxsuh4
Combinatorics of periods in strings
2003
Journal of combinatorial theory. Series A
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We consider the set G n of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducible period set. ...
set, and exhibit an algorithm to sample uniformly period sets through irreducible period set. r ...
The autocorrelations involved in (2) and (3) exist by predicate X and only differ from each other by one period. This implies (2) and (3) and proves that the chain is maximal. ...
doi:10.1016/s0097-3165(03)00123-7
fatcat:6i34aon5qjfhdopmo6gosrnrqu
Predicate-aware, makespan-preserving software pipelining of scheduling tables
2014
ACM Transactions on Architecture and Code Optimization (TACO)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
It also takes advantage of the predicated execution mechanisms of our embedded execution platform. ...
The activation period thus sets the length of the scheduling table, and is denoted by len(S). ...
Durations are in time units whose actual real-time length depends on the application (e.g. milliseconds). Journal Name, Vol. V, No. ...
doi:10.1145/2579676
fatcat:22odeuxk7fbwxjv6hmepbvq6nm
Deriving a new efficient algorithm for min-period retiming
2005
Proceedings of the 2005 conference on Asia South Pacific design automation - ASP-DAC '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Contrary to all previous algorithms, which used binary search to check feasibilities on a range of candidate periods, the derived algorithm checks the optimality of a current period directly. ...
A new efficient algorithm is derived for the minimal period retiming problem by formal methods. ...
Recent progresses on semiconductor technology saw an increase on the number of global wires whose delays are longer than one clock period [8, 1] , and retiming is again a promising technique that could ...
doi:10.1145/1120725.1120774
dblp:conf/aspdac/Zhou05
fatcat:ixjwlxsf7zgd7km33o5z3dbkmq
Flexible and Efficient Decision-Making for Proactive Latency-Aware Self-Adaptation
2018
ACM Transactions on Autonomous and Adaptive Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Making an adaptation decision with these characteristics requires solving an optimization problem to select the adaptation path that maximizes an objective function over a finite look-ahead horizon. ...
We refer to the period of time between when a tactic is started and when its effect is produced as tactic latency. ...
The route is divided into D segments of equal length, and an adaptation decision is made periodically at the boundary between segments. ...
doi:10.1145/3149180
fatcat:yysk2bg3gbdbjbwuefyt3ct6hm
One-Dimensional Packing: Maximality Implies Rationality
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Every set of natural numbers determines a generating function convergent for q ∈ (-1,1) whose behavior as q → 1^- determines a germ. ...
It is shown that any D-avoiding set that is maximal in the class of D-avoiding sets (with respect to germ-ordering) is ultimately periodic. This implies an analogous result for packings. ...
For any circular word c with length a, we define |c| := P c (q)/(1 − q a ); it is equal to the generating function of the infinite periodic word c : c : c : c : . . .. ...
arXiv:1704.08785v4
fatcat:cdh5kajaxzgudnoy433fx27kn4
Calamities and Counterfactuals: A Historical View of Polarity Reversal
2015
Anglophonia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is text/html.
As noted in 2.2, if a prediction is made about a past event, the maximality of information is understood as increased by the fact that the past is usually known, allowing for denial of anything not said ...
R-based inferences and Levinson's I-heuristic). (7b), on the other hand, suggests it is not functional now, and thus exploits the Quantity 1 maxim of supplying as much information as is necessary (also ...
doi:10.4000/anglophonia.520
fatcat:7lxva7gxfzfcfoiftjlxlkwokm
From Durational Specifications to TLA Designs of Timed Automata
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In such a stepwise design process, durational features are reduced while automaton features increase gradually. ...
A notation called generic composition is used to simplify the manipulation of predicates. ...
A common durational specification is a predicate P ( , p) on the length = |i| of the interval and the integral of a boolean function p during the interval. ...
doi:10.1007/978-3-540-30482-1_38
fatcat:oshburuq2nhgnhqt4w2ydu3qze
« Previous
Showing results 1 — 15 out of 21,402 results