Filters








291,032 Hits in 5.5 sec

Page 1261 of Mathematical Reviews Vol. , Issue 99b [page]

1991 Mathematical Reviews  
The bounded fixpoint construct is an inflationary iteration mechanism that never exceeds some pre- defined bounding bag. We study these constructs in the context of a standard (nested) bag algebra.  ...  Summary: “We compare the expressive power on finite models of two extensions of first-order logic L with equality.  ... 

An Algebra for Pomsets

Stéphane Grumbach, Tova Milo
1999 Information and Computation  
This paper is motivated by the study of the impact of different language primitives on the expressive power.  ...  We show that the use of partially ordered types increases the expressive power significantly.  ...  ACKNOWLEDGMENTS The authors thank Vassos Hadzilacos and Leonid Libkin for technical remarks and the anonymous referees for helpful comments. Final manuscript received November 25, 1998  ... 
doi:10.1006/inco.1998.2777 fatcat:bkuazzfvgbbyhmairson3wqw2y

A mixed integer disjunctive model for transmission network expansion

L. Bahiense, G.C. Oliveira, M. Pereira, S. Granville
2001 IEEE Transactions on Power Systems  
The mixed integer program is solved by a commercial Branch and Bound code, where an upper bound provided by a heuristic solution is used to reduce the tree search.  ...  The classical nonlinear mixed integer formulation of the transmission network expansion problem cannot guarantee finding the optimal solution due to its nonconvex nature.  ...  ACKNOWLEDGMENT The authors would like to thank S. Binato from CEPEL, who developed the GRASP code for transmission planning [10] , which used in this work.  ... 
doi:10.1109/59.932295 fatcat:eqmdzu4po5eblnwahklutdksoy

A Mixed Integer Disjunctive Model for Transmission Network Expansion

L. Bahiense, G. C. Oliveira, M. Pereira, S. Granville
2001 IEEE Power Engineering Review  
The mixed integer program is solved by a commercial Branch and Bound code, where an upper bound provided by a heuristic solution is used to reduce the tree search.  ...  The classical nonlinear mixed integer formulation of the transmission network expansion problem cannot guarantee finding the optimal solution due to its nonconvex nature.  ...  ACKNOWLEDGMENT The authors would like to thank S. Binato from CEPEL, who developed the GRASP code for transmission planning [10] , which used in this work.  ... 
doi:10.1109/mper.2001.4311560 fatcat:jdoyyzwxm5b3zldncy4hulj7yq

Partial Evaluation of the Euclidian Algorithm (Extended Version)

Olivier Danvy, Mayer Goldberg
1997 BRICS Report Series  
<br />We observe that the number of iterations in the Euclidian algorithm<br />is bounded by a number that can be computed given either of the two<br />arguments.  ...  Each of them presents a challenge<br />for partial evaluation. The Euclidian algorithm is one of them,<br />and in this article, we make it amenable to partial evaluation.  ...  The diagram of Section 1 was drawn with Kristoffer Rose's X Y -pic package.  ... 
doi:10.7146/brics.v4i1.18780 fatcat:sfii2n6lfbhongcyhyxjttxs4e

Is Polynomial Time Choiceless? [chapter]

Erich Grädel, Martin Grohe
2015 Lecture Notes in Computer Science  
A long time ago, Yuri Gurevich made precise the problem of whether there is a logic capturing polynomial-time on arbitrary finite structures, and conjectured that no such logic exists.  ...  We survey some recent results on this logic.  ...  Example 3 (Power Set). We shall construct a BGS-term that defines the power set of the set of atoms. We observe that we can express the union of two sets s and t as s ∪ t := Union(Pair(s, t)).  ... 
doi:10.1007/978-3-319-23534-9_11 fatcat:n6rczztse5g4nezyzahgrmis3q

Iteration abstraction in Sather

Stephan Murer, Stephen Omohundro, David Stoutamire, Clemens Szyperski
1996 ACM Transactions on Programming Languages and Systems  
Sather extends the notion of an iterator in a powerful new way. We argue that iteration ab stractions belong in class interfaces on an equal footing with routines.  ...  Finally, we describe experiences with iterators in the Sather compiler and libraries. Abstract Sather extends the notion of an iterator in a powerful new way.  ...  Acknowledgements Many people were involved in the Sather 1 design discussions. Ari Huttunen in particular made suggestions which improved the design of iterators.  ... 
doi:10.1145/225540.225541 fatcat:aks75m6ihba57jvsc2tvk53jgy

Logical Loops [chapter]

Joachim Schimpf
2002 Lecture Notes in Computer Science  
This is a shorthand notation for the most commonly used recursive control structure: the iteration or tail recursion.  ...  We present a concrete proposal for enhancing Prolog and Prolog based Constraint Logic Programming languages with a new language construct, the logical loop.  ...  Without aggregation operators, a priori bounded quantifiers are very limited in their expressive power.  ... 
doi:10.1007/3-540-45619-8_16 fatcat:g6g7dtegg5dx3ikup55xkxtx4q

On the Total Power Capacity of Regular-LDPC Codes With Iterative Message-Passing Decoders

Karthik Ganesan, Pulkit Grover, Jan Rabaey, Andrea Goldsmith
2016 IEEE Journal on Selected Areas in Communications  
Motivated by recently derived fundamental limits on total (transmit + decoding) power for coded communication with VLSI decoders, this paper investigates the scaling behavior of the minimum total power  ...  However, we also prove that regular-LDPC codes and iterative message-passing decoders cannot meet existing fundamental limits on total power under the wire model.  ...  These results are used in Section IV to prove constructive bounds on total power for the Node Model. Lemma 3.  ... 
doi:10.1109/jsac.2015.2504276 fatcat:pi2hysqkwfawbgoy43rnvpq46y

Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much? [chapter]

Mathias Herrmann, Alexander May
2009 Lecture Notes in Computer Science  
We look at iterated power generators si = s e i−1 mod N for a random seed s0 ∈ ZN that in each iteration output a certain amount of bits.  ...  This means in particular that the Blum-Blum-Shub generator should be used with an output of less than half of the bits per iteration and the RSA generator with e = 3 with less than a 1 3 -fraction of the  ...  Interestingly, this is exactly the bound that Blackburn et al. [2] conjectured to be the best possible bound one can obtain by looking at two iterations of the PRG.  ... 
doi:10.1007/978-3-642-10366-7_29 fatcat:q6o3vntccvcu3iqlxgklqbxhky

Transforming high-level data-parallel programs into vector operations

Jan F. Prins, Daniel W. Palmer
1993 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPOPP '93  
of nested sequences and a small set of transformational rules to distribute iterators through the constructs of the language. † This work supported in part by DARPA/ISTO Contract N00014-91-C-0114. 1 The  ...  Fully-parallel execution of a high-level data-parallel language based on nested sequences, higher order functions and generalized iterators can be realized in the vector model using a suitable representation  ...  The power of the iterator construct comes from its ability to give a per-element recipe for the computation of a result value.  ... 
doi:10.1145/155332.155345 dblp:conf/ppopp/PrinsP93 fatcat:gnunajtjcnahfhddeacecsk7ma

Relative Completeness of Abstraction Refinement for Software Model Checking [chapter]

Thomas Ball, Andreas Podelski, Sriram K. Rajamani
2002 Lecture Notes in Computer Science  
Intuitively, this means that the use of fixpoint iteration over abstractions and a particular backwards refinement of the abstractions has the effect of exploring the entire state space of all possible  ...  We therefore consider a new kind of quality measure for such methods, which is completeness relative to a (powerful but unrealistic) oraclebased method.  ...  The power of either, Method I or II, depends on the given formalism which fixes the set of atomic formulas.  ... 
doi:10.1007/3-540-46002-0_12 fatcat:pxgyyl4kkfgltgauwalxwlzrjq

An algebra for pomsets [chapter]

Stéphane Grumbach, Tova Milo
1995 Lecture Notes in Computer Science  
This paper is motivated by the study of the impact of di erent language primitives on the expressive power.  ...  We show that the use of partially ordered types increases the expressive power signi cantly.  ...  Acknowledgments: The authors wish to thank Vassos Hadzilacos for technical remarks.  ... 
doi:10.1007/3-540-58907-4_16 fatcat:dydnv63vmzh35oofg4lhu6z5pi

Improving polyhedral code generation for high-level synthesis

Wei Zuo, Peng Li, Deming Chen, Louis-Noel Pouchet, Shunan Zhong, Jason Cong
2013 2013 International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS)  
We demonstrate our techniques on a collection of affine benchmarks, reducing by 2x on average (up to 10x) the area used after high-level synthesis.  ...  In this work we study the changes to the state-of-the-art polyhedral code generator CLooG which are required to tailor it for HLS purposes.  ...  This work was supported in part by the Center for Domain-Specific Computing (CDSC) funded by NSF "Expeditions in Computing" award 0926127; China Postdoctoral Science Foundation (2012M520115); and the SRC  ... 
doi:10.1109/codes-isss.2013.6659002 dblp:conf/codes/ZuoLCPZC13 fatcat:4e5bazdlfbe7dgu2ullbkzp7uu

Gallager codes for CDMA applications .I. Generalizations, constructions, and performance bounds

V. Sorokine, F.R. Kschischang, S. Pasupathy
2000 IEEE Transactions on Communications  
Bounds on the frame-error probability for a maximum-likelihood decoder are obtained.  ...  We focus on applications of low-rate Gallager (low-density parity-check) codes in code-division multiple-access schemes.  ...  Fig. 2 . 2 (a) Function B() obtained by direct enumeration of sequences [expressions (12) and (13)] and (b) function B () obtained by bounding techniques of expressions(3)and(6).  ... 
doi:10.1109/26.871391 fatcat:oaz62hd5f5a2zjwtm234tl24fy
« Previous Showing results 1 — 15 out of 291,032 results