Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
37
-38- A NOTE ON ITERATIVE HANOI
"... A recent note in SIGPLAN Notices [1] presents an iterative solution to the wellknown Tower of Hanoi problem. I would like to mention that an essentially equivalent solution was published several years ago in a book co-authored by Claude R. Baudoin and myself [2, pages 376-378]. If I recall correctly ..."
Abstract
- Add to MetaCart
;transfer n disks from peg x to peg y, using peg z as intermediate storage". The body of the procedure is if n> 0 then end ff Hanoi (n-l, z, z, y) ; move (x, y) ; Hanoi (n-l, z, y, x) As with any recursive procedure, a tree can be associated with an execution of the procedure; here it is a binary tree
Multi-loop Position Analysis via Iterated Linear Programming
"... Abstract — This paper presents a numerical method able to isolate all configurations that an arbitrary loop linkage can adopt, within given ranges for its degrees of freedom. The procedure is general, in the sense that it can be applied to single or multiple intermingled loops of arbitrary topology, ..."
Abstract
- Add to MetaCart
Abstract — This paper presents a numerical method able to isolate all configurations that an arbitrary loop linkage can adopt, within given ranges for its degrees of freedom. The procedure is general, in the sense that it can be applied to single or multiple intermingled loops of arbitrary topology
Multi-loop Position Analysis via Iterated Linear Programming
"... Abstract — This paper presents a numerical method able to isolate all configurations that an arbitrary loop linkage can adopt, within given ranges for its degrees of freedom. The procedure is general, in the sense that it can be applied to single or multiple intermingled loops of arbitrary topology. ..."
Abstract
- Add to MetaCart
Abstract — This paper presents a numerical method able to isolate all configurations that an arbitrary loop linkage can adopt, within given ranges for its degrees of freedom. The procedure is general, in the sense that it can be applied to single or multiple intermingled loops of arbitrary topology
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
"... Abstract. A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P (n + 1) depends on the truth of P (n), the correctness of iteration n+1 of a for-loop depends on iteration n having been completed correctly. This paper presents the induce-construct, a new progra ..."
Abstract
- Add to MetaCart
Abstract. A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P (n + 1) depends on the truth of P (n), the correctness of iteration n+1 of a for-loop depends on iteration n having been completed correctly. This paper presents the induce-construct, a new
Author manuscript, published in "ICDT (2012) 46-60" Highly Expressive Query Languages for Unordered Data Trees ∗
, 2012
"... We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family. All languages may be seen as adding some form of control on top of a set of basic pattern queries. The results highlight the impact and interplay ..."
Abstract
- Add to MetaCart
We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family. All languages may be seen as adding some form of control on top of a set of basic pattern queries. The results highlight the impact and interplay
i i
"... , and we can say the Campbell bandwidth is the minimum average bandwidth for en-coding the process across all possible distortion levels. IX. CONCLUSION We have presented two new derivations of the coefficient rate in-troduced by Campbell. One derivation solidifies its interpretation as a coefficien ..."
Abstract
- Add to MetaCart
to the variance of that component. We discussed the implications of the latter result for realization-adap-tive source coding and provided a connection with the familiar reverse water-filling result from rate distortion theory. From the coefficient rate, we defined a quantity called the Campbell bandwidth of a
Bottom-Up Beats Top-Down
"... In PEPA, the calculation of the transitions enabled by a process accounts for a large part of the time for the state space exploration of the underlying Markov chain. Unlike other approaches based on recursion, we present a new technique that is iterative—it traverses the process ’ binary tree from ..."
Abstract
- Add to MetaCart
In PEPA, the calculation of the transitions enabled by a process accounts for a large part of the time for the state space exploration of the underlying Markov chain. Unlike other approaches based on recursion, we present a new technique that is iterative—it traverses the process ’ binary tree from
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
- Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available
POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR
"... 2010 to my wife, Joyce, and my family...- Résumé- ..."
Results 1 - 10
of
37
