Exploració per títol

Ara es mostren els items 45440-45459 de 245836

    • Computing parameter ranges in constructive geometric constraint solving: Implementation and correctness proof 

      Hidalgo, Marta; Joan Arinyo, Robert (Elsevier, 2012-07)
      Article
      Accés restringit per política de l'editorial
      In parametric design, changing values of parameters to get different solution instances to the problem at hand is a paramount operation. One of the main issues when generating the solution instance for the actual set of ...

    • Computing plastic Lagrangian trajectories from real time Eulerian hydrodynamic data. Application to the Barcelona coastline 

      Seyedrezazaribaf, Nafiseh (Universitat Politècnica de Catalunya, 2021-09-10)
      Treball Final de Grau
      Accés obert
      La presència de deixalles marines en els oceans és un problema que afecta tant a el medi marí com a la zona costanera, i és reconegut per organitzacions com la Comissió Europea com un problema mediambiental global. Davant ...

    • Computing repairs for constraint violations in UML/OCL conceptual schemas 

      Oriol Hilari, Xavier; Teniente López, Ernest; Tort, Albert (Elsevier, 2015-06-25)
      Article
      Accés obert
      Updating the contents of an information base may violate some of the constraints defined over the schema. The classical way to deal with this problem has been to reject the requested update when its application would lead ...

    • Computing reputation for collaborative private networks 

      Nin Guerrero, Jordi; Carminati, Barbara; Ferrari, Elena; Torra i Reventós, Vicenç (IEEE Computer Society Publications, 2009)
      Text en actes de congrés
      Accés obert
      The use of collaborative network services is increasing, therefore, the protection of the resources and relations shared by network participants is becoming crucial. One of the main issues in such networks is the evaluation ...

    • Computing resource management in software-defined and cognitive radios 

      Marojevic, Vuk (Universitat Politècnica de Catalunya, 2010-10-09)
      Tesi
      Accés obert
      Our research aims at contributing to the evolution of modern wireless communications and to the development of software-defined radio (SDR) and cognitive radio, in particular. It promotes a general resource management ...

    • Computing Safe Contention Bounds for Multicore Resources with Round-Robin and FIFO Arbitration 

      Fernandez, Gabriel; Jalle, Javier; Abella Ferrer, Jaume; Quiñones, Eduardo; Vardanega, Tullio; Cazorla, Francisco J. (Institute of Electrical and Electronics Engineers (IEEE), 2016-10-11)
      Article
      Accés obert
      Numerous researchers have studied the contention that arises among tasks running in parallel on a multicore processor. Most of those studies seek to derive a tight and sound upper-bound for the worst-case delay with which ...

    • Computing similarity between piecewise-linear functions 

      Agarwal, Pankaj; Aronov, Boris; Kreveld, Marc van; Löffler, Maarten; Silveira, Rodrigo Ignacio (ACM Press. Association for Computing Machinery, 2010)
      Text en actes de congrés
      Accés obert
      We study the problem of computing the similarity between two piecewise-linear bivariate functions de ned over a common domain, where the surfaces they de ne in 3D|polyhedral terrains|can be transformed vertically by a ...

    • Computing size-independent matrix problems on systolic array processors 

      Navarro Guerrero, Juan José; Llaberia Griñó, José M.; Valero Cortés, Mateo (Institute of Electrical and Electronics Engineers (IEEE), 1986)
      Text en actes de congrés
      Accés obert
      A methodology to transform dense to band matrices is presented in this paper. This transformation, is accomplished by triangular blocks partitioning, and allows the implementation of solutions to problems with any given ...

    • Computing size-independent matrix problems on systolic array processors 

      Navarro Guerrero, Juan José; Llaberia Griñó, José M.; Valero Cortés, Mateo (1985)
      Report de recerca
      Accés obert
      A methodology to transform dense to banded matrices is presented in this paper. This transformation, is accomplished by triangular blocks partitioning, and allows the implementation of silutions to problems with any given ...

    • Computing the barycenter graph by means of the graph edit distance 

      Bardaji Goikoetxea, Itziar; Ferrer Sumsi, Miquel; Sanfeliu Cortés, Alberto (2010)
      Text en actes de congrés
      Accés obert
      The barycenter graph has been shown as an alternative to obtain the representative of a given set of graphs. In this paper we propose an extension of the original algorithm which makes use of the graph edit distance in ...

    • Computing the canonical representation of constructible sets 

      Brunat Blay, Josep Maria; Montes Lozano, Antonio (2016-03-08)
      Article
      Accés obert
      Constructible sets are needed in many algorithms of Computer Algebra, particularly in the GröbnerCover and other algorithms for parametric polynomial systems. In this paper we review the canonical form ofconstructible sets ...

    • Computing the expected Markov reward rates with stationarity detection and relative error control 

      Suñé, Víctor (Kluwer Academic Publishers, 2016-03-11)
      Article
      Accés obert
      By combining in a novel way the randomization method with the stationary detection technique, we develop two new algorithms for the computation of the expected reward rates of finite, irreducible Markov reward models, with ...

    • Computing the Green function for a Dirichlet problem on spider networks 

      Carmona Mejías, Ángeles; Mitjana Riera, Margarida (2018)
      Text en actes de congrés
      Accés obert

    • Computing the Importance of Schema Elements Taking Into Account the Whole SCHEMA 

      Villegas Niño, Antonio (Universitat Politècnica de Catalunya, 2009-06)
      Projecte Final de Màster Oficial
      Accés obert
      Conceptual Schemas are one of the most important artifacts in the development cycle of information systems. To understand the conceptual schema is essential to get involved in the information system that is described within ...

    • Computing the medial axis transform of polygonal domains by tracing paths 

      Joan Arinyo, Robert; Pérez Vidal, Lluís; Vilaplana Pastó, Josep (1999-04)
      Report de recerca
      Accés obert
      A practical algorithm for computing the medial axis transform of 2D polygonal domains is presented. The algorithm computes the medial axis by tracing its paths. The medial axis is generated in the form of a graph where ...

    • Computing the medial axis transform of polygonal objects by testing discs 

      Vilaplana Pastó, Josep (1996-10)
      Report de recerca
      Accés obert
      An algorithm for computing the medial axis transform of 2D polygonal domains is presented. It exploits the full connectivity of the medial axis in polygonal domains by advancing a previously known maximal inscribed disc ...

    • Computing the relevant instances that may violate an OCL constraint 

      Cabot Sagrera, Jordi; Teniente López, Ernest (2005-03)
      Report de recerca
      Accés obert
      Integrity checking is aimed at efficiently determining whether the state of the information base is consistent after the application of a set of structural events. One possible way to achieve efficiency is to consider ...

    • Computing the topology of planar semi-algebraic sets 

      Cucker Farkas, Juan Felipe; Rosselló Llompart, Francesc A. (1990)
      Report de recerca
      Accés obert
      In this note we give a new algorithm for computing the topological type of a planar semi-algebraic set that run in time О(m super 4 n super 19 (log n) super 3) where M is the number of polynomials defining the set and n ...

    • Computing the volume enclosed by a periodic surface and its variation to model a follower pressure 

      Rahimi Lenji, Mohammad; Zhang, Kuan; Arroyo Balaguer, Marino (2015-03-01)
      Article
      Accés obert
      In modeling and numerically implementing a follower pressure in a geometrically nonlinear setting, one needs to compute the volume enclosed by a surface and its variation. For closed surfaces, the volume can be expressed ...

    • Computing upper and lower bounds for the J-integral in two-dimensional linear elasticity 

      Xuan, Z C; Parés Mariné, Núria; Peraire Guitart, Jaume (2006-01)
      Article
      Accés obert
      We present an a posteriori method for computing rigorous upper and lower bounds for the J-integral in two-dimensional linear elasticity. The J-integral, which is typically expressed as a contour integral, is recast as a ...