http://biblioteca.universia.net/vernivel.do?start=260&nivel=1203.17 Mostrando recursos 261 - 280 de 13,650 es http://biblioteca.universia.net/img/logotipo.jpg http://biblioteca.universia.net/ http://biblioteca.universia.net/ficha.do?id=42128201 We showhow to use model classes of partial logic to define semantics of general knowledge-based reasoning. Heinrich Herre http://biblioteca.universia.net/ficha.do?id=42130152 Automatically generating presentations from content available on the World Wide Web, mainly through multimedia databases, is made possible with the advent of the Semantic Web and the increasing availability of multimedia repositories. The Semantic Web enables machines to work with assumptions on the meaning and interrelations of multimedia content. This makes it possible to present information in a more coherent manner, paving the way for the field of automatic multimedia presentation generat... R. C. E. Van Velthoven http://biblioteca.universia.net/ficha.do?id=42139286 This paper describes a model of persistence in (C)LP languages and two di#erent and practically very useful ways to implement this model in current systems. The fundamental idea is that persistence is a characteristic of certain dynamic predicates (i.e., those which encapsulate state). The main e#ect of declaring a predicate persistent is that the dynamic changes made to such predicates persist from one execution to the next one. After proposing a syntax for declaring persistent predicates, a... J. Correas,J. M. Gomez,M. Carro,D. Cabeza,M. Hermenegildo,J. Correas Et Al http://biblioteca.universia.net/ficha.do?id=42139689 This paper describes a model of persistence in (C)LP languages and two di#erent and practically very useful ways to implement this model in current systems. The fundamental idea is that persistence is a characteristic of certain dynamic predicates (which encapsulate state). The main e#ect of declaring a predicate persistent is that the dynamic changes made to such predicates persist from one execution to the next one. After proposing a syntax for declaring persistent predicates, a simple, fil... J. Correas,J. M. Gomez,M. Carro,D. Cabeza,M. Hermenegildo,J. Correas Et Al http://biblioteca.universia.net/ficha.do?id=38294890 Malvaso, Marisa Andrea; Facultad de Informática http://biblioteca.universia.net/ficha.do?id=38294909 Sosa, Eduardo Omar; Facultad de Informática http://biblioteca.universia.net/ficha.do?id=38295106 Diab, Jose Carlos; Facultad de Informática http://biblioteca.universia.net/ficha.do?id=41971509 In this paper we define a general class of problems in computational geometry that we cal connectability problems. Connectability problems involve connecting objects by some kind of connections, avoiding obstacles. This includes many different types of problems like intersection problems, visibility problems, etc. Studying these problems in a general framework might led to general solutions. Some solutions axe presented. In paxticulax, an O(nlog nlogiog n) solution is given for determining al... Vakgroep Informatica http://biblioteca.universia.net/ficha.do?id=37854520 Tesis de Lic. en Informática Administrativa Oroz Perales, Adriana; Flores Trejo, Carlos Antonio; Flores Trejo, Carlos Antonio http://biblioteca.universia.net/ficha.do?id=38137488 En: Educar en Castilla-La Mancha Toledo 2005, n. 27, febrero ; p. 16-17 Educar. área de Organización e Informática; Junta de Comunidades de Castilla-La Mancha. Consejería de Educación y Ciencia http://biblioteca.universia.net/ficha.do?id=38137488 En: Educar en Castilla-La Mancha Toledo 2005, n. 27, febrero ; p. 16-17 Educar. área de Organización e Informática; Junta de Comunidades de Castilla-La Mancha. Consejería de Educación y Ciencia http://biblioteca.universia.net/ficha.do?id=42017080 Conceptual modeling techniques such as EER, ORM and to some extent the UML have been developed in the past for building information systems. These techniques or suitable extensions can often also be used to design business rules at a conceptual level. In particular in this paper we adopt the well-known CM technique of ORM, which has a rich complement of business rule specification, and develop ORM-ML, an XML-based markup language for ORM. Clearly domain modeling of this kind will be closely r... Vakgroep Informatica,En Toegepaste Informatica http://biblioteca.universia.net/ficha.do?id=38294891 Flores, Mariel; PIatti, Flavia; Facultad de Informática http://biblioteca.universia.net/ficha.do?id=38294896 Mola, Vanesa; Russo, Wanda Mariana; Facultad de Informática http://biblioteca.universia.net/ficha.do?id=44756839 Hoy día entendemos como nuevas tecnologías las aplicaciones que los medios informáticos (máquinas y programas) ponen al alcance de las diferentes áreas de conocimiento y de la gran diversidad de actividades humanas. Desde los grandes programas de investigación científica hasta los juegos de las vídeo-consolas, nuestra sociedad se ha visto transformada de una manera radical y rápida con la introducción de los medios informáticos en todos los campos. La música, como una actividad más de nuestra... Romero Carmona, Juan Bautista http://biblioteca.universia.net/ficha.do?id=37661523 - http://biblioteca.universia.net/ficha.do?id=42148132 Model, Applied to the Vending Machine Example a new meta-type which is a specialization of the interface one. Thus, component type denitions are very similar to interface denitions. Right now the vending machine component type includes the denitions of two attributes that will be congured according to each instance expected behavior. The two attributes are used to dene which kind of drinks are available and if the machine is running or not. Raphal Marvie http://biblioteca.universia.net/ficha.do?id=41565265 In this paper we propose a new line search algorithm that ensures global convergence of the PolakRibi `ere conjugate gradient method for the unconstrained minimization of nonconvex differentiable functions. In particular, we show that every limit point produced by the Polak-Ribi`ere iteration is a stationary point of the objective function. Moreover, we prove that, asymptotically, the first stationary point along the search direction can be accepted and that, under strong convexity assumption... S. Lucidi,R. Giugno http://biblioteca.universia.net/ficha.do?id=41884185 Although every computable data type has an initial algebra specification with hidden functions, it may happen that some of the homomorphic images of the data type are not models of the specification. The latter are reducts of algebras that would be models of the specification if all its functions were visible, whereas the homomorphic images of the data type are independent of the specification and need not be compatible with the hidden functions used in it. A hidden function specification tha... J. A. Bergstra,J. Heering http://biblioteca.universia.net/ficha.do?id=41886381 GEL (Graph Exchange Language) is a formalism for the compressed exchange of (term) graphs between processes. Key features of GEL are speed, compactness, independence of readers and writers, and compositionality. Typically, GEL representations of large, tree-like graph structures require an average of a little more than one byte storage for representing one node in the graph. Orthogonally to GEL, other protocols can be used to exchange data residing in the nodes of a graph. An algebraic specif... J. F. T. Kamperman