oalib

OALib Journal期刊

ISSN: 2333-9721

费用:99美元

投稿

匹配条件: “Kleiman” ,找到相关结果约79条。
列表显示的所有文章,均可免费获取
第1页/共79条
每页显示
Automatismo & Imago: Aportes a la investigación de la imagen inconsciente en las Artes Plásticas
Kleiman,Jorge;
Cuadernos del Centro de Estudios en Dise?±o y Comunicaci?3n. Ensayos , 2012,
Abstract: this essay will talk about the creative process in the visual arts. from psychic automatism as a precedure and artistic manner infuenced by surrealism, it's study goes forward as a complex process that merges the intelectual, the sensible and the unqualifable. it's fundation has it's roots in psychoanalysis, semiotics and historical creative practices. from the artistic experience of the author, different methods are put in discussion, methods that can be considered as a systematization for inspiration. to conclude, the text brings a remark of the surrealist movement, specially in argentina from the formative legacy of battle planas.
Li es de Catende: um estudo sobre a luta pela constru o de uma autogest o na Zona da Mata Sul de Pernambuco na década de 1990
Fernando Kleiman
Sociedade e Estado , 2006, DOI: 10.1590/s0102-69922006000300021
Abstract:
On an Algorithm of Frieze
Howard Kleiman
Mathematics , 2001,
Abstract: The algorithm reduces the running time of an algorithm of Frieze from O(n^{1.5)) to O(n^(4/3 + o)). It also introduces the concept of admissible permutations that is used in algorithms for obtaining solutions to the AP and the TSP.
H-admissible permutations and the HCP
Howard Kleiman
Mathematics , 2002,
Abstract: This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton circuit(cycle)or else the algorithm points to at least one vertex that cannot belong to any hamilton circuit(cycle) of G. We give criteria for determining which vertices should be examined.
Obtaining hamilton cicuits in graphs and digraphs
Howard Kleiman
Mathematics , 2002,
Abstract: This paper improves algorithms given in math.CO/0012036. Although the graph (digraph) becomes non-random as the algorithm proceeds, the probability for success stays the same. We also give examples.
The Floyd-Warshall Algorithm, the AP and the TSP III
Howard Kleiman
Mathematics , 2002,
Abstract: We clarify the exposition of Phases 2 and 3a in "The Floyd-Warshall Algorithm, the AP and the TSP". We also improve and simplify theorem 3.6 . In line with clarifying the exposition, we change the matrices in examples 3.4 and 3.5 of "The Floyd-Warshall Algorithm, the AP and the TSP II".
Hamilton Circuits in Graphs and Directed Graphs
Howard Kleiman
Mathematics , 2000,
Abstract: We give polynomial-time algorithms for obtaining hamilton circuits in random graphs, G, and random directed graphs, D. If n is finite, we assume that G or D contains a hamilton circuit. If G is an arbitrary graph containing a hamilton circuit, we conjecture that Algorithm G always obtains a hamilton circuit in polynomial time.
The Floyd-Warshall Algorithm, the AP and the TSP
Howard Kleiman
Mathematics , 2001,
Abstract: We use admissible permutations and a variant of the Floyd-Warshall algorithm to obtain an optimal solution to the Assignment Problem. Using another variant of the F-W algorithm, we obtain an approximate solution to the Traveling Salesman Problem. We also give a sufficient condition for the approximate solution to be an optimal solution.
Bounds for the Solutions of Cubic Diophantine Equations
Howard Kleiman
Mathematics , 2004,
Abstract: The original version of this paper did not take into account that there may be solutions (x_0, y_o)in Z X Z of f(x,y) = x^3 + p(y)x + q(y) = 0 even though w_0 = (-3D(y_0))^(1/2) is irrational.
The Floyd-WarshallAlgorithm and the Asymmetric TSP
Howard Kleiman
Mathematics , 2004,
Abstract: We improve proofs in "The Floyd-Warshall Algorithm, the AP and the TSP (III). We also simplify the method for obtaining a good upper bound for an optimal solution.
第1页/共79条
每页显示


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.