LEADER 02367nam 2200361 450 001 9910724327603321 005 20230624200952.0 035 $a(CKB)5470000002601421 035 $a(NjHacI)995470000002601421 035 $a(EXLCZ)995470000002601421 100 $a20230624d2021 uy 0 101 0 $afre 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aArchitecte et ses mode?les $eintentions, connaissance et projets a? la pe?riode contemporaine /$fJean-Philippe Garric, Andre?s Avila-Go?mez 210 1$aParis :$cE?ditions de la Sorbonne,$d2021. 215 $a1 online resource (319 pages) $cillustrations 225 1 $aHisto.art 330 $aLe huis-clos dans l'atelier, ou? l'architecte exerce un art autore?fe?rentiel, qui puise ses mode?les en lui-me?me, plus que dans la nature, re?sonne de l'expe?rience et de la me?moire des visites in situ des e?difices et des espaces re?els, parfois parcourus lors de lointains pe?riples. L'intention qui pre?side au choix du mode?le, pre?ce?de le processus de connaissance. Ce souci, ce de?sir, qui motivent les enque?tes et l'extension des corpus, participent d'un projet plus ou moins collectif ou individuel, plus ou moins intuitif ou explicite? : une ambition d'e?difier. De sorte que le moment, technique en apparence, de l'observation et du travail graphique, qui permettent de re?duire un objet complexe a? une se?rie limite?e de figures, ou de photographies, trouve son ressort dans un souci de distinction par la de?couverte et la compre?hension d'objets ine?dits ; par la re?vision des savoirs pre?e?tablis ; ou puise son impulsion, parfois obscure, dans des expe?riences esthe?tiques ou mentales plus personnelles ou intimes. Quatorze essais, re?unis ici par Jean-Philippe Garric, interrogent la me?canique et l'e?conomie des mode?les, a? travers leur formation, leur pratique et leur porte?e politique. 410 0$aHisto.art. 606 $aArchitecture$xHistory 615 0$aArchitecture$xHistory. 676 $a720.9 700 $aGarric$b Jean-Philippe$01218296 702 $aAvila-Go?mez$b Andre?s 801 0$bNjHacI 801 1$bNjHacl 906 $aBOOK 912 $a9910724327603321 996 $aArchitecte et ses mode?les$93390249 997 $aUNINA LEADER 07185nam 22008535 450 001 9910483655603321 005 20251226195529.0 010 $a1-280-39062-X 010 $a9786613568540 010 $a3-642-17517-1 024 7 $a10.1007/978-3-642-17517-6 035 $a(CKB)2670000000064713 035 $a(SSID)ssj0000475850 035 $a(PQKBManifestationID)11291924 035 $a(PQKBTitleCode)TC0000475850 035 $a(PQKBWorkID)10485960 035 $a(PQKB)11523545 035 $a(DE-He213)978-3-642-17517-6 035 $a(MiAaPQ)EBC3066226 035 $a(PPN)149893590 035 $a(BIP)32543296 035 $a(EXLCZ)992670000000064713 100 $a20101203d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Computation $e21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part I /$fedited by Otfried Cheong, Kyung-Yong Chwa, Kunsoo Park 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XVIII, 465 p. 66 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6506 300 $aInternational conference proceedings. 311 08$a3-642-17516-3 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Regular Labelings and Geometric Structures -- Algorithmic Aspects of Secure Computation and Communication -- Session 1A. Approximation Algorithm I -- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament -- A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 -- Approximate Periodicity -- Approximating the Average Stretch Factor of Geometric Graphs -- Session 1B. Complexity I -- Satisfiability with Index Dependency -- Anonymous Fuzzy Identity-Based Encryption for Similarity Search -- Improved Randomized Algorithms for 3-SAT -- Quantum Counterfeit Coin Problems -- Session 2A. Data Structure and Algorithm I -- Priority Range Trees -- Should Static Search Trees Ever Be Unbalanced? -- Levelwise Mesh Sparsification for Shortest Path Queries -- Unit-Time Predecessor Queries on Massive Data Sets -- Session 2B. Combinatorial Optimization -- Popularity at Minimum Cost -- Structural and Complexity Aspects of Line Systems of Graphs -- Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra -- Generating Trees on Multisets -- Session 3A. Graph Algorithm I -- Seidel Minor, Permutation Graphs and Combinatorial Properties -- Simultaneous Interval Graphs -- Unbalanced Graph Partitioning -- On the Intersection of Tolerance and Cocomparability Graphs -- Flows in One-Crossing-Minor-Free Graphs -- Session 3B. Complexity II -- From Holant to #CSP and Back: Dichotomy for Holant c Problems -- Computing Sparse Multiples of Polynomials -- Fractal Parallelism: Solving SAT in Bounded Space and Time -- Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity -- New Upper Bounds on the Average PTF Density of Boolean Functions -- Session 4A. Computational Geometry I -- An Optimal Algorithmfor Computing Angle-Constrained Spanners -- Approximating Minimum Bending Energy Path in a Simple Corridor -- Session 4B. Graph Coloring I -- Analysis of an Iterated Local Search Algorithm for Vertex Coloring -- Bounded Max-colorings of Graphs -- Session 5A. Fixed Parameter Tractability -- Parameterized Algorithms for Boxicity -- On Tractable Cases of Target Set Selection -- Combining Two Worlds: Parameterised Approximation for Vertex Cover -- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time -- Session 5B. Optimization -- Lower Bounds for Howard?s Algorithm for Finding Minimum Mean-Cost Cycles -- Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut -- An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems -- A Faster Algorithm for the Maximum Even Factor Problem. 330 $aThis volume contains the proceedings of the 21st Annual International S- posium on Algorithms and Computations (ISAAC 2010), held in Jeju, Korea during December 15-17, 2010. Past editions have been held in Tokyo, Taipei, Nagoya,HongKong,Beijing,Cairns,Osaka,Singapore,Taejon,Chennai,Taipei, Christchurch, Vancouver, Kyoto, Hong Kong, Hainan, Kolkata, Sendai, Gold Coast, and Hawaii over the years 1990-2009. ISAACis anannualinternationalsymposiumthatcoversthe verywide range of topics in algorithms and computation. The main purpose of the symposium is to provide a forum for researchers working in algorithms and the theory of computation where they can exchange ideas in this active research community. In response to the call for papers, ISAAC 2010 received 182 papers. Each submission was reviewed by at least three Program Committee members with the assistance of external referees. Since there were many high-quality papers, the Program Committee's task was extremely di'cult. Through an extensive discussion, the Program Committee accepted 77 of the submissions to be p- sented at the conference. Two special issues, one of Algorithmica and one of the International Journal of Computational Geometry and Applications,were prepared with selected papers from ISAAC 2010. The best paper award was given to "From Holant to #CSP and Back: c DichotomyforHolant Problems"byJin-YiCai,SangxiaHuangandPinyanLu, and the best student paper award to "Satis'ability with Index Dependency" by Hongyu Liang and Jing He. Two eminent invited speakers,David Eppstein from UniversityofCalifornia,Irvine,andMattFranklinfromUniversityofCalifornia, Davis, also contributed to this volume. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6506 606 $aComputer programming 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer networks 606 $aComputer graphics 606 $aArtificial intelligence$xData processing 606 $aProgramming Techniques 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Communication Networks 606 $aComputer Graphics 606 $aData Science 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer networks. 615 0$aComputer graphics. 615 0$aArtificial intelligence$xData processing. 615 14$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Communication Networks. 615 24$aComputer Graphics. 615 24$aData Science. 676 $a005.11 701 $aAsano$b T$g(Tetsuo),$f1949-$01757721 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483655603321 996 $aAlgorithms and computation$94195666 997 $aUNINA