نتایج جستجو برای: aanes

تعداد نتایج: 23  

1997
Florent de Dinechin Patricia Le Moenner

This paper presents methods based on the formalism of aane recurrence equations for the synthesis of bit-level regular architectures from word-level (integer or real) algorithms. Because of bit-level dependency analysis, the arrays have optimal eeciency. We present two possible design ows leading to architectures based either on bit-parallel or bit-serial operators. The rst one is fully automat...

1996
Patrice Quinton Sanjay Rajopadhye Tanguy Risset

We address the problem of computation upon Z Z-polyhedra which are intersections of polyhedra and integral lattices. We introduce a canonic representation for Z Z-polyhedra which allow to perform comparisons and transformations of Z Z-polyhedra with the help of a computational kernel on polyhedra. This contribution is a step toward the manipulation of images of polyhedra by aane functions, and ...

1997
Luc Bougé David Cachera

We present an assertional approach to prove properties of Alpha programs. Alpha is a functional language based on aane recurrence equations. We rst present two kinds of operational semantics for Alpha together with some equivalence and connuence properties of these semantics. We then present an attempt to provide Alpha with an external logical framework. We therefore deene a proof method based ...

Journal: :J. Strategic Inf. Sys. 2011
Margunn Aanestad Tina Blegind Jensen

0963-8687/$ see front matter 2011 Elsevier B.V doi:10.1016/j.jsis.2011.03.006 ⇑ Corresponding author. Tel.: +47 22852545; fax: E-mail addresses: [email protected] (M. Aanes 1 Tel.: +45 38152455. Initiatives that seek to realize the vision of nation-wide information infrastructures (II) in healthcare have often failed to achieve their goals. In this paper, we focus on approaches used to plan, c...

1993
Paul Feautrier Tanguy Risset

Most parallelization techniques for DO loop nests are based on reindexation. Reindexation yields a new iteration space, which is a convex integer polyhedron deened by a set of aane constraints. Parallel code generation needs thus to scan all the integer points of this convex, thereby requiring the construction of a new DO loop nest. We detail an algorithm for this purpose, which relies on a par...

Journal: :Frontiers in political science 2022

This essay addresses two related questions raised by the editors of research topic for “Beyond Frontiers Political Science: Is Good Governance Possible in Cataclysmic Times?” In particular, it explores: 1) how we can identify new tools and perspectives from which to address multiple mutually reinforcing problems accumulating around climate change; 2) what institutional alternatives nation-state...

1997
David Cachera

We present an assertional approach to prove properties of Alpha programs. Alpha is a functional language based on aane recurrence equations. We rst present two kinds of operational semantics for Alpha together with some equivalence and connuence properties of these semantics. We then present an attempt to provide Alpha with an external logical framework. We therefore deene a proof method based ...

1994
Zbigniew Chamski

An important problem in automatic parallelization of scientiic programs is to generate loops from an algebraic description of the iteration domain. The usual technique is to produce a perfectly nested set of loops, whose bounds consist in maxima and minima of several aane functions. However, perfect loop nests suuer from the run-time overhead of evaluating bound expressions and do not allow to ...

2012
Stef Weijers Inger Greve Alsos Pernille Bronken Eidesen Rob Broekman Jelte Rozema

The dwarf shrub Cassiope tetragona is increasingly used for arctic climate reconstructions, the reliability of which depends on a linear climate-growth relationship. Here, we examine the stability of the relationship between climate and annual growth parameters by using a spatial scale from the high to subarctic and long-term experimental warming at a high arctic site. We created four growth ch...

1997
EPHANE GAUBERT

The set of min-max functions F : R n ! R n is the least set containing coordinate substitutions and translations and closed under pointwise max, min, and function composition. The Duality Conjecture asserts that the trajectories of a min-max function, considered as a dynamical system, have a linear growth rate (cycle time) and shows how this can be calculated through a representation of F as an...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید