LEADER 05760nam 22007575 450 001 996465328703316 005 20230220232438.0 010 $a3-642-13193-X 024 7 $a10.1007/978-3-642-13193-6 035 $a(CKB)2670000000017279 035 $a(SSID)ssj0000446460 035 $a(PQKBManifestationID)11249935 035 $a(PQKBTitleCode)TC0000446460 035 $a(PQKBWorkID)10496101 035 $a(PQKB)10302963 035 $a(DE-He213)978-3-642-13193-6 035 $a(MiAaPQ)EBC3065241 035 $a(PPN)149073046 035 $a(EXLCZ)992670000000017279 100 $a20100427d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aExperimental Algorithms$b[electronic resource] $e9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings /$fedited by Paola Festa 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XII, 514 p. 126 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6049 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-13192-1 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Experimental Study of Resilient Algorithms and Data Structures -- Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs -- Contributed Regular Papers -- Alternative Routes in Road Networks -- Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks -- Space-Efficient SHARC-Routing -- A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation -- Contraction of Timetable Networks with Realistic Transfers -- Distributed Time-Dependent Contraction Hierarchies -- Practical Compressed Suffix Trees -- Maximum Cliques in Protein Structure Comparison -- Exact Bipartite Crossing Minimization under Tree Constraints -- Bit-Parallel Search Algorithms for Long Patterns -- Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments -- Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars -- Time-Dependent Contraction Hierarchies and Approximation -- A New Combinational Logic Minimization Technique with Applications to Cryptology -- Randomized Rounding for Routing and Covering Problems: Experiments and Improvements -- The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm -- An Approximate ?-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem -- A Branch-and-Price Algorithm for Multi-mode Resource Leveling -- Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs -- Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem -- Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation -- New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery -- A Metaheuristic for a Two Echelon Location-Routing Problem -- New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint -- An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem -- An Analysis of Heuristics for Vertex Colouring -- Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm -- Experiments with a Feasibility Pump Approach for Nonconvex MINLPs -- Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems -- Realtime Classification for Encrypted Traffic -- Data Propagation with Guaranteed Delivery for Mobile Networks -- Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries -- Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure -- Policy-Based Benchmarking of Weak Heaps and Their Relatives, -- Modularity-Driven Clustering of Dynamic Graphs -- Gateway Decompositions for Constrained Reachability Problems -- Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere -- Fault Recovery in Wireless Networks: The Geometric Recolouring Approach -- Geometric Minimum Spanning Trees with GeoFilterKruskal -- Practical Nearest Neighbor Search in the Plane. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6049 606 $aComputer programming 606 $aAlgorithms 606 $aArtificial intelligence 606 $aApplication software 606 $aComputer networks 606 $aInformation storage and retrieval systems 606 $aProgramming Techniques 606 $aAlgorithms 606 $aArtificial Intelligence 606 $aComputer and Information Systems Applications 606 $aComputer Communication Networks 606 $aInformation Storage and Retrieval 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aArtificial intelligence. 615 0$aApplication software. 615 0$aComputer networks. 615 0$aInformation storage and retrieval systems. 615 14$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aArtificial Intelligence. 615 24$aComputer and Information Systems Applications. 615 24$aComputer Communication Networks. 615 24$aInformation Storage and Retrieval. 676 $a005.1 702 $aFesta$b Paola$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSEA 2010 906 $aBOOK 912 $a996465328703316 996 $aExperimental Algorithms$9772547 997 $aUNISA LEADER 01806nas 2200589-a 450 001 996206253203316 005 20220808213021.0 011 $a1747-0234 035 $a(DE-599)ZDB2130327-7 035 $a(OCoLC)1086937483 035 $a(CKB)111056756955008 035 $a(CONSER)--2019204564 035 $a(EXLCZ)99111056756955008 100 $a20011212a20019999 --- a 101 0 $aeng 135 $aurmn||||m|aaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aInternational journal for the study of the Christian church$b[electronic resource] 210 $aEdinburgh ;$aNew York $cT&T Clark$d2001- 210 3 $aAbingdon, Oxon, UK $cTaylor & Francis 300 $aRefereed/Peer-reviewed 300 $aTitle from journal contents screen viewed Feb. 2, 2009. 311 $a1474-225X 517 1 $aIJSCC 517 1 $aStudy of the Christian church 606 $aChurch history$vPeriodicals 606 $aTheology$vPeriodicals 606 $aChurch$vPeriodicals 606 $aÉglise$vPériodiques 606 $aÉglise$xHistoire$vPériodiques 606 $aThéologie$vPériodiques 606 $aChurch$2fast$3(OCoLC)fst00860364 606 $aChurch history$2fast$3(OCoLC)fst00860740 606 $aTheology$2fast$3(OCoLC)fst01149559 608 $aPeriodicals.$2fast 615 0$aChurch history 615 0$aTheology 615 0$aChurch 615 6$aÉglise 615 6$aÉglise$xHistoire 615 6$aThéologie 615 7$aChurch. 615 7$aChurch history. 615 7$aTheology. 676 $a260.9 712 02$aTaylor & Francis, 906 $aJOURNAL 912 $a996206253203316 996 $aInternational journal for the study of the Christian church$92024764 997 $aUNISA LEADER 02705nam 2200613Ia 450 001 9910455045403321 005 20200520144314.0 010 $a0-520-92500-9 010 $a1-59734-518-0 024 7 $a10.1525/9780520925007 035 $a(CKB)111056485640954 035 $a(EBL)224430 035 $a(OCoLC)475931195 035 $a(SSID)ssj0000116522 035 $a(PQKBManifestationID)11128565 035 $a(PQKBTitleCode)TC0000116522 035 $a(PQKBWorkID)10033834 035 $a(PQKB)10565128 035 $a(MiAaPQ)EBC224430 035 $a(DE-B1597)648853 035 $a(DE-B1597)9780520925007 035 $a(EXLCZ)99111056485640954 100 $a20020316d2000 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aBy popular demand $erevitalizing representative democracy through deliberative elections /$fJohn Gastil 205 $a1st ed. 210 $aBerkeley ;$aLondon $cUniversity of California Press$dc2000 215 $a1 online resource (276 p.) 300 $aDescription based upon print version of record. 311 $a0-520-22364-0 320 $aIncludes bibliographical references (p. 239-257) and index. 327 $aPreliminaries; Contents; Acknowledgments; 1. Introduction; 2. Exit and Public Voice in Representative Democracy; 3. Why Elections Fail to Ensure Accountability; 4. Appraising Radical and Conventional Electoral Reforms; 5. Public Expression in American Politics; 6. Glimpses of the Deliberative Public; 7. The Citizen Panels Proposal; 8. The Political Impact of Citizen Panels; 9. Electoral Experimentation; Notes; References; Index 330 $aJohn Gastil challenges conventional assumptions about public opinion, elections, and political expression in this persuasive treatise on how to revitalize the system of representative democracy in the United States. Gastil argues that American citizens have difficulty developing clear policy interests, seldom reject unrepresentative public officials, and lack a strong public voice. 606 $aPolitical participation$zUnited States 606 $aElections$zUnited States 606 $aRepresentative government and representation$zUnited States 606 $aForums (Discussion and debate) 615 0$aPolitical participation 615 0$aElections 615 0$aRepresentative government and representation 615 0$aForums (Discussion and debate) 676 $a324.630973 700 $aGastil$b John$0738123 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910455045403321 996 $aBy Popular Demand$92476571 997 $aUNINA