Emerging research in artificial intelligence and computational intelligence : International Conference, AICI 2011, Taiyuan, China, September 23-25, 2011 : proceedings / Hepu Deng [and others] (eds.). |
Creatore | [International Conference on Artificial Intelligence and Computational Intelligence (2011 : Taiyuan Shi, China)] |
Estensione | 1 online resource (xviii, 609 pages) : illustrations (some color). |
Accesso persona | Deng, Hepu |
Genere/Forma |
Electronic books
Conference papers and proceedings |
Soggetto non controllato |
Computer science
Computer Communication Networks Computer software Information storage and retrieval systems Artificial intelligence Artificial Intelligence (incl. Robotics) Information Systems Applications (incl. Internet) Computation by Abstract Devices Algorithm Analysis and Problem Complexity Information Storage and Retrieval |
ISBN |
9783642242823
3642242820 9783642242816 3642242812 9781642242823 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UCHICAGO-11075939 |
[International Conference on Artificial Intelligence and Computational Intelligence (2011 : Taiyuan Shi, China)]
![]() |
|
![]() | |
Lo trovi qui: University of Chicago | |
Algorithmic learning theory : 22nd international conference, ALT 2011, Espoo, Finland, October 5-7, 2011 : proceedings / Jyrki Kivinen [and others] (eds.). |
Creatore | [ALT 2011 (2011 : Espoo, Finland)] |
Estensione | 1 online resource (xiii, 451 pages) : illustrations (some color). |
Accesso persona | Kivinen, Jyrki, 1965- |
Genere/Forma |
Electronic books
Conference papers and proceedings |
Soggetto non controllato |
Computer science
Computer software Logic design Artificial intelligence Artificial Intelligence (incl. Robotics) Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs Information Systems Applications (incl. Internet) |
ISBN |
9783642244124
3642244122 3642244114 9783642244117 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UCHICAGO-11076087 |
[ALT 2011 (2011 : Espoo, Finland)]
![]() |
|
![]() | |
Lo trovi qui: University of Chicago | |
Intelligent computing theories : 9th International Conference, ICIC 2013, Nanning, China, July 28-31, 2013. Proceedings / De-Shuang Huang, Vitoantonio Bevilacqua, Juan Carlos Figueroa, Prashan premaratne (eds.). |
Creatore | [International Conference on Intelligent Computing (9th : 2013 : Nanning, China)] |
Estensione | 1 online resource (xxiii, 651 pages) : illustrations (black and white). |
Accesso persona |
Huang, De-Shuang, editor
Bevilacqua, Vitoantonio, editor Figueroa, Juan Carlos, editor Premaratne, Prashan, editor |
Genere/Forma |
Electronic books
Conference papers and proceedings Ebook Congresses |
Soggetto non controllato |
Computer science
Artificial intelligence Computer vision Optical pattern recognition Bioinformatics Image Processing and Computer Vision Pattern Recognition Information Systems Applications (incl. Internet) Computation by Abstract Devices |
ISBN |
9783642394799
3642394795 9783642394782 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Neural Networks -- Nature Inspired Computing and Optimization -- Cognitive Science and Computational Neuroscience -- Knowledge Discovery and Data Mining -- Evolutionary Learning and Genetic Algorithms -- Machine Learning Theory and Methods -- Natural Language Processing and Computational Linguistics -- Fuzzy Theory and Models -- Fuzzy Systems and Soft Computing -- Unsupervised and Reinforcement Learning -- Intelligent Computing in Finance/Banking -- Intelligent Computing in Communication Networks -- Intelligent Computing in Network Software/Hardware -- Intelligent Image/Document Retrievals -- Intelligent Data Fusion and Information Security -- Intelligent Prediction and Time Series Analysis -- Intelligent Sensor Networks -- Intelligent Fault Diagnosis -- Virtual Reality and Human-Computer Interaction -- Intelligent Computing in Robotics -- Intelligent Computing in Computer Vision. |
Record Nr. | UCHICAGO-11079820 |
[International Conference on Intelligent Computing (9th : 2013 : Nanning, China)]
![]() |
|
![]() | |
Lo trovi qui: University of Chicago | |
Developments in language theory : 16th International Conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings / Hsu-Chun Yen, Oscar H. Ibarra (eds.). |
Creatore | [Conference on Developments in Language Theory (16th : 2012 : Taipei, Taiwan)] |
Estensione | 1 online resource (xiv, 478 pages) : illustrations. |
Accesso persona |
Yen, Hsu-Chun, 1958-
Ibarra, Oscar H. |
Genere/Forma |
Electronic books
Conference papers and proceedings |
Soggetto non controllato |
Computer science
Coding theory Logic design Computational complexity Computation by Abstract Devices Mathematical Logic and Formal Languages Logics and Meanings of Programs Coding and Information Theory Discrete Mathematics in Computer Science |
ISBN |
9783642316531
3642316530 3642316522 9783642316524 |
Classificazione | 54.10 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
The Kind Hearted Dragon Prof. Sheng Yu, 1950-2012 / Andrew L. Szilard -- P and dP Automata: Unconventional versus Classical Automata / Erzsébet Csuhaj-Varjú -- Recovering Strings in Oracles: Quantum and Classic / Kazuo Iwama -- Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ / Juraj Hromkovič, Rastislav Královič, Richard Královič and Richard Štefanec -- Cellular Automata, the Collatz Conjecture and Powers of 3/2 / Jarkko Kari -- Quotient Complexities of Atoms of Regular Languages / Janusz Brzozowski and Hellis Tamm -- Decidability of Geometricity of Regular Languages / Marie-Pierre Béal, Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne and Sylvain Lombardy -- Inside the Class of REGEX Languages / Markus L. Schmid -- Computing the Edit-Distance between a Regular Language and a Context-Free Language / Yo-Sub Han, Sang-Ki Ko and Kai Salomaa -- Semigroups with a Context-Free Word Problem / Michael Hoffmann, Derek F. Holt, Matthew D. Owens and Richard M. Thomas -- Generalized Derivations with Synchronized Context-Free Grammars / Markus Holzer, Sebastian Jakobi and Ian McQuillan -- Non-erasing Variants of the Chomsky-Schützenberger Theorem / Alexander Okhotin -- Regular and Context-Free Pattern Languages over Small Alphabets / Daniel Reidenbach and Markus L. Schmid.
On Context-Free Languages of Scattered Words / Zoltan Ésik and Satoshi Okawa -- Homomorphisms Preserving Deterministic Context-Free Languages / Tommi Lehtinen and Alexander Okhotin -- Unary Coded NP-Complete Languages in ASPACE (log log n) / Viliam Geffert and Dana Pardubská -- Dense Completeness / Andreas Krebs and Klaus-Jörn Lange -- From Equivalence to Almost-Equivalence, and Beyond--Minimizing Automata with Errors (Extended Abstract) / Markus Holzer and Sebastian Jakobi -- Analogs of Fagin's Theorem for Small Nondeterministic Finite Automata / Christos A. Kapoutsis and Nans Lefebvre -- States and Heads Do Count for Unary Multi-head Finite Automata / Martin Kutrib, Andreas Malcher and Matthias Wendlandt -- Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness / Mathieu Caralp, Pierre-Alain Reynier and Jean-Marc Talbot -- Unambiguous Constrained Automata / Michaël Cadilhac, Alain Finkel and Pierre McKenzie -- Two-Dimensional Sgraffito Automata / Daniel Průša and František Mráz -- Two-Way Transducers with a Two-Way Output Tape / Olivier Carton -- Learning Rational Functions / Adrien Boiret, Aurélien Lemay and Joachim Niehren -- Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata / Giovanna J. Lavado, Giovanni Pighizzini and Shinnosuke Seki -- Fine and Wilf's Theorem for k-Abelian Periods / Juhani Karhumäki, Svetlana Puzynina and Aleksi Saarela -- Pseudoperiodic Words / Alexandre Blondin Massé, Sébastien Gaboury and Sylvain Hallé Acceptance Conditions for [omega]-Languages / Alberto Dennunzio, Enrico Formenti and Julien Provillard -- Checking Determinism of Regular Expressions with Counting / Haiming Chen and Ping Lu -- Biautomata for k-Piecewise Testable Languages / Ondřej Klíma and Libor Polák -- On Centralized PC Grammar Systems with Context-Sensitive Components / Friedrich Otto -- Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars / Matthias Büchse, Andreas Maletti and Heiko Vogler -- The State Complexity of Star-Complement-Star / Galina Jirásková and Jeffrey Shallit -- On State Complexity of Finite Word and Tree Languages / Aniruddh Gandhi, Bakhadyr Khoussainov and Jiamou Liu -- Squares in Binary Partial Words / Francine Blanchet-Sadri, Yang Jiao and John M. Machacek -- The Avoidability of Cubes under Permutations / Florin Manea, Mike Müller and Dirk Nowotka -- Hairpin Completion with Bounded Stem-Loop / Szilárd Zsolt Fazekas, Robert Mercaş and Kayoko Shikishima-Tsuji -- Morphic Primitivity and Alphabet Reductions / Hossein Nevisi and Daniel Reidenbach -- On a Hierarchy of Languages with Catenation and Shuffle / Nils Erik Flick and Manfred Kudlek -- Characterizing Languages by Normalization and Termination in String Rewriting (Extended Abstract) / Jeroen Ketema and Jakob Grue Simonsen -- Geometry and Dynamics of the Besicovitch and Weyl Spaces / Ville Salo and Ilkka Törmä -- A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay / Laura Giambruno, Sabrina Mantaci, Jean Néraud and Carla Selmi. |
Record Nr. | UCHICAGO-11077093 |
[Conference on Developments in Language Theory (16th : 2012 : Taipei, Taiwan)]
![]() |
|
![]() | |
Lo trovi qui: University of Chicago | |
Computing and Combinatorics : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings / Joachim Gudmundsson, Julián Mestre, Taso Viglas (eds.). |
Creatore | [COCOON 2012 (2012 : Sydney, N.S.W.)] |
Estensione | 1 online resource. |
Accesso persona |
Gudmundsson, Joachim
Mestre, Julián Viglas, Taso |
Genere/Forma |
Electronic books
Conference papers and proceedings |
Soggetto non controllato |
Computer science
Computer Communication Networks Computer software Computational complexity Artificial intelligence Computer graphics Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices |
ISBN |
9783642322419
3642322417 9783642322402 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree / Binay Bhattacharya and Tsunehiko Kameda -- A Simple D2-Sampling Based PTAS for k-Means and other Clustering Problems / Ragesh Jaiswal, Amit Kumar and Sandeep Sen -- Speed Scaling for Maximum Lateness / Evripidis Bampis, Dimitrios Letsios, Ioannis Milis and Georgios Zois -- Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? / Peter Floderus, Mirosław Kowaluk, Andrzej Lingas and Eva-Marta Lundell -- Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs / Ivona Bezáková and Zachary Langley -- Online Knapsack Problem with Removal Cost / Xin Han, Yasushi Kawase and Kazuhisa Makino -- An Improved Exact Algorithm for TSP in Degree-4 Graphs / Mingyu Xiao and Hiroshi Nagamochi -- Dynamic Programming for H-minor-free Graphs / Juanjo Rué, Ignasi Sau and Dimitrios M. Thilikos -- Restricted Max-Min Fair Allocations with Inclusion-Free Intervals / Monaldo Mastrolilli and Georgios Stamoulis -- An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks / Maxim A. Babenko, Kamil Salikhov and Stepan Artamonov -- Towards Optimal and Expressive Kernelization for d-Hitting Set / René van Bevern.
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs / Jean-François Couturier, Pinar Heggernes, Pim van 't Hof and Yngve Villanger -- A Local Algorithm for Finding Dense Bipartite-Like Subgraphs / Pan Peng -- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs / Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung and Yue-Li Wang -- On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property / Biing-Feng Wang and Chih-Hsuan Li -- Rainbow Colouring of Split and Threshold Graphs / L. Sunil Chandran and Deepak Rajendraprasad -- Approximating the Rainbow -- Better Lower and Upper Bounds / Alexandru Popa -- Ramsey Numbers for Line Graphs and Perfect Graphs / Rémy Belmonte, Pinar Heggernes, Pim van 't Hof and Reza Saei -- Geodesic Order Types / Oswin Aichholzer, Matias Korman, Alexander Pilz and Birgit Vogtenhuber -- Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number / Stephane Durocher and Saeed Mehrabi -- Monotone Paths in Planar Convex Subdivisions / Adrian Dumitrescu, Günter Rote and Csaba D. Tóth -- The Cost of Bounded Curvature / Hyo-Sil Kim and Otfried Cheong. Optimally Solving a Transportation Problem Using Voronoi Diagrams / Darius Geiß, Rolf Klein and Rainer Penninger -- Unexplored Steiner Ratios in Geometric Networks / Paz Carmi and Lilach Chaitman-Yerushalmi -- Geometric RAC Simultaneous Drawings of Graphs / Evmorfia Argyriou, Michael Bekos, Michael Kaufmann and Antonios Symvonis -- Simultaneous Embeddings with Vertices Mapping to Pre-specified Points / Taylor Gordon -- Multilevel Drawings of Clustered Graphs / Fabrizio Frati -- Outerplanar Graph Drawings with Few Slopes / Kolja Knauer, Piotr Micek and Bartosz Walczak -- Fáry's Theorem for 1-Planar Graphs / Seok-Hee Hong, Peter Eades, Giuseppe Liotta and Sheung-Hung Poon -- Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application / Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno and Hiroki Arimura -- External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue / Alka Bhushan and Sajith Gopalan -- Partially Specified Nearest Neighbor Search / Tomas Hruz and Marcel Schöngens -- Multi-pattern Matching with Bidirectional Indexes / Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen and Niko Välimäki -- Succinct Representations of Binary Trees for Range Minimum Queries / Pooya Davoodi, Rajeev Raman and Srinivasa Rao Satti. Lower Bounds against Weakly Uniform Circuits / Ruiwen Chen and Valentine Kabanets -- On TC0 Lower Bounds for the Permanent / Jeff Kinne -- Formula Complexity of Ternary Majorities / Kenya Ueno -- On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles / Fahad Panolan and Ashutosh Rai -- The Complexity of Unary Subset Sum / Nutan Limaye, Meena Mahajan and Karteek Sreenivasaiah -- On the Advice Complexity of Tournaments / Sebastian Ben Daniel -- A Remark on One-Wayness versus Pseudorandomness / Periklis A. Papakonstantinou and Guang Yang -- Integral Mixed Unit Interval Graphs / Van Bang Le and Dieter Rautenbach -- Complementary Vertices and Adjacency Testing in Polytopes / Benjamin A. Burton -- Online Coloring of Bipartite Graphs with and without Advice / Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovič and Lucia Keller -- Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms / Paweł Górecki and Oliver Eulenstein -- On the 2-Central Path Problem / Yongding Zhu and Jinhui Xu -- Making Profit in a Prediction Market / Jen-Hou Chou, Chi-Jen Lu and Mu-En Wu -- Computing Shapley Value in Supermodular Coalitional Games / David Liben-Nowell, Alexa Sharp, Tom Wexler and Kevin Woods -- Equilibria of GSP for Range Auction / H.F. Ting and Xiangzhong Xiang -- Stretch in Bottleneck Games / Costas Busch and Rajgopal Kannan. |
Record Nr. | UCHICAGO-11077264 |
[COCOON 2012 (2012 : Sydney, N.S.W.)]
![]() |
|
![]() | |
Lo trovi qui: University of Chicago | |
Neural information processing : 18th International Conference, ICONIP 2011, Shanghai, China, November 13-17, 2011, proceedings. Part I / Bao-Liang Lu, Liqing Zhang, James Kwok (eds.). |
Creatore | [ICONIP (Conference) (18th : 2011 : Shanghai, China)] |
Estensione | 1 online resource (xxxviii, 752 pages). |
Accesso persona |
Lu, Bao-Liang
Zhang, Liqing, Ph. D. Kwok, James, Dr |
Genere/Forma |
Electronic books
Conference papers and proceedings |
Soggetto non controllato |
Computer science
Data mining Artificial intelligence Computer simulation Computer vision Optical pattern recognition Computation by Abstract Devices Pattern Recognition Data Mining and Knowledge Discovery Simulation and Modeling Image Processing and Computer Vision |
ISBN |
9783642249556
3642249558 9783642249549 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UCHICAGO-11076196 |
[ICONIP (Conference) (18th : 2011 : Shanghai, China)]
![]() |
|
![]() | |
Lo trovi qui: University of Chicago | |
Bio-inspired computing and applications : 7th International Conference on Intelligent Computing, ICIC 2011, Zhengzhou, China, August 11-14, 2011 : revised selected papers / De-Shuang Huang, Yong Gan, Prashan Premaratne, Kyungsook Han (eds.). |
Creatore | [International Conference on Intelligent Computing (7th : 2011 : Zhengzhou, China)] |
Estensione | 1 online resource (xxiii, 713 pages) : illustrations. |
Accesso persona | Huang, De-Shuang |
Genere/Forma |
Electronic books
Conference papers and proceedings |
Soggetto non controllato |
Computer science
Artificial intelligence Computer vision Optical pattern recognition Pattern Recognition Image Processing and Computer Vision Computation by Abstract Devices User Interfaces and Human Computer Interaction |
ISBN |
9783642245534
3642245536 3642245528 9783642245527 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UCHICAGO-11076442 |
[International Conference on Intelligent Computing (7th : 2011 : Zhengzhou, China)]
![]() |
|
![]() | |
Lo trovi qui: University of Chicago | |
Parameterized and exact computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers / edited by Dániel Marx, Peter Rossmanith |
Creatore | [IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)] |
Estensione | 1 online resource (viii, 271 pages). |
Accesso persona |
Marx, Dániel
Rossmanith, Peter |
Genere/Forma |
Electronic books
Conference papers and proceedings |
Soggetto non controllato |
Computer science
Information theory Computer software Computational complexity Algebra -- Data processing Algorithms Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Theory of Computation Symbolic and Algebraic Manipulation Computation by Abstract Devices |
ISBN |
9783642280504
3642280501 9783642280498 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | On Multiway Cut Parameterized above Lower Bounds / Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk -- Parameterized Complexity of Firefighting Revisited / Marek Cygan, Fedor V. Fomin and Erik Jan van Leeuwen -- Parameterized Complexity in Multiple-Interval Graphs: Domination / Minghui Jiang and Yong Zhang -- A Faster Algorithm for Dominating Set Analyzed by the Potential Method / Yoichi Iwata -- Contracting Graphs to Paths and Trees / Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov and Christophe Paul -- Increasing the Minimum Degree of a Graph by Contractions / Petr A. Golovach, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos -- Planar Disjoint-Paths Completion / Isolde Adler, Stavros G. Kolliopoulos and Dimitrios M. Thilikos -- Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing / Peter Damaschke -- New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree / Alexander Golovnev -- Improved Parameterized Algorithms for above Average Constraint Satisfaction / Eun Jung Kim and Ryan Williams -- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal / Bart M.P. Jansen and Stefan Kratsch -- Kernel Bounds for Path and Cycle Problems / Hans L. Bodlaender, Bart M.P. Jansen and Stefan Kratsch -- On the Hardness of Losing Width / Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh -- Safe Approximation and Its Relation to Kernelization / Jiong Guo, Iyad Kanj and Stefan Kratsch -- Simpler Linear-Time Kernelization for Planar Dominating Set / Torben Hagerup -- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs / René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier and Mathias Weller -- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width / Hajo Broersma, Petr A. Golovach and Viresh Patel -- Finding Good Decompositions for Dynamic Programming on Dense Graphs / Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle and Martin Vatshelle -- Parameterized Maximum Path Coloring / Michael Lampis -- On Cutwidth Parameterized by Vertex Cover / Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh -- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics / Robert Ganian. |
Record Nr. | UCHICAGO-11076741 |
[IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)]
![]() |
|
![]() | |
Lo trovi qui: University of Chicago | |
How the world computes : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings / edited by S. Barry Cooper, Anuj Dawar, Benedikt Löwe |
Creatore | [Conference on Computability in Europe (8th : 2012 : Cambridge, England)] |
Estensione | 1 online resource. |
Accesso persona |
Cooper, S. B. (S. Barry)
Dawar, Anuj Löwe, Benedikt |
Genere/Forma |
Electronic books
Conference papers and proceedings |
Soggetto non controllato |
Computer science
Computer software Computational complexity Algebra -- Data processing Logic, Symbolic and mathematical Computation by Abstract Devices Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Mathematical Logic and Foundations |
ISBN |
9783642308703
3642308708 9783642308697 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Ordinal Analysis and the Infinite Ramsey Theorem / Bahareh Afshari and Michael Rathjen -- Curiouser and Curiouser: The Link between Incompressibility and Complexity / Eric Allender -- Information and Logical Discrimination / Patrick Allo -- Robustness of Logical Depth / Luís Antunes, Andre Souto and Andreia Teixeira -- Turing's Normal Numbers: Towards Randomness / Verónica Becher -- Logic of Ruler and Compass Constructions / Michael Beeson -- On the Computational Content of the Brouwer Fixed Point Theorem / Vasco Brattka, Stéphane Le Roux and Arno Pauly -- Square Roots and Powers in Constructive Banach Algebra Theory / Douglas S. Bridges and Robin S. Havea -- The Mate-in-n Problem of Infinite Chess Is Decidable / Dan Brumleve, Joel David Hamkins and Philipp Schlicht -- A Note on Ramsey Theorems and Turing Jumps / Lorenzo Carlucci and Konrad Zdanowski -- Automatic Functions, Linear Time and Learning / John Case, Sanjay Jain, Samuel Seah and Frank Stephan -- An Undecidable Nested Recurrence Relation / Marcel Celaya and Frank Ruskey -- Hard Instances of Algorithms and Proof Systems / Yijia Chen, Jörg Flum and Moritz Müller -- On Mathias Generic Sets / Peter A. Cholak, Damir D. Dzhafarov and Jeffry L. Hirst -- Complexity of Deep Inference via Atomic Flows / Anupam Das -- Connecting Partial Words and Regular Languages / Jürgen Dassow, Florin Manea and Robert Mercaş
Randomness, Computation and Mathematics / Rod Downey -- Learning, Social Intelligence and the Turing Test / Why an "Out-of-the-Box" Turing Machine Will Not Pass the Turing Test / Bruce Edmonds and Carlos Gershenson -- Confluence in Data Reduction: Bridging Graph Transformation and Kernelization / Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier and Olga Runge -- Highness and Local Noncappability / Chengling Fang, Wang Shenling and Guohua Wu -- Turing Progressions and Their Well-Orders / David Fernández Duque and Joost J. Joosten -- A Short Note on Spector's Proof of Consistency of Analysis / Fernando Ferreira -- Sets of Signals, Information Flow, and Folktales / Mark Alan Finlayson -- On the Foundations and Philosophy of Info-metrics / Amos Golan -- On Mathematicians Who Liked Logic / The Case of Max Newman / Ivor Grattan-Guinness -- Densities and Entropies in Cellular Automata / Pierre Guillon and Charalampos Zinoviadis -- Foundational Analyses of Computation / Yuri Gurevich -- Turing Machine-Inspired Computer Science Results / Juris Hartmanis -- NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs / Sepp Hartung and André Nichterlein -- A Direct Proof of Wiener's Theorem / Matthew Hendtlass and Peter Schuster -- Effective Strong Nullness and Effectively Closed Sets / Kojiro Higuchi and Takayuki Kihara. Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable / Martin Huschenbett -- On the Relative Succinctness of Two Extensions by Definitions of Multimodal Logic / Wiebe van der Hoek, Petar Iliev and Barteld Kooi -- On Immortal Configurations in Turing Machines / Emmanuel Jeandel -- A Slime Mold Solver for Linear Programming Problems / Anders Johannson and James Zou -- Multi-scale Modeling of Gene Regulation of Morphogenesis / Jaap A. Kaandorp, Daniel Botman, Carlos Tamulonis and Roland Dries -- Tree-Automatic Well-Founded Trees / Alexander Kartzow, Jiamou Liu and Markus Lohrey -- Infinite Games and Transfinite Recursion of Multiple Inductive Definitions / Keisuke Yoshii and Kazuyuki Tanaka -- A Hierarchy of Immunity and Density for Sets of Reals / Takayuki Kihara -- How Much Randomness Is Needed for Statistics? / Bjørn Kjos-Hanssen, Antoine Taveneaux and Neil Thapen -- Towards a Theory of Infinite Time Blum-Shub-Smale Machines / Peter Koepke and Benjamin Seyfferth -- Turing Pattern Formation without Diffusion / Shigeru Kondo -- Degrees of Total Algorithms versus Degrees of Honest Functions / Lars Kristiansen -- A 5n -- o(n) Lower Bound on the Circuit Size over U2 of a Linear Boolean Function / Alexander S. Kulikov, Olga Melanich and Ivan Mihajlin -- Local Induction and Provably Total Computable Functions: A Case Study / Andrés Cordón-Franco and F. Félix Lara-Martín. What is Turing's Comparison between Mechanism and Writing Worth? / Jean Lassègue and Giuseppe Longo -- Substitutions and Strongly Deterministic Tilesets / Bastien Le Gloannec and Nicolas Ollinger -- The Computing Spacetime / Fotini Markopoulou -- Unifiability and Admissibility in Finite Algebras / George Metcalfe and Christoph Röthlisberger -- Natural Signs / Ruth Garrett Millikan -- Characteristics of Minimal Effective Programming Systems / Samuel E. Moelius III -- After Turing: Mathematical Modelling in the Biomedical and Social Sciences / From Animal Coat Patterns to Brain Tumours to Saving Marriages / James D. Murray -- Existence of Faster than Light Signals Implies Hypercomputation already in Special Relativity / Péter Németi and Gergely Székely -- Turing Computable Embeddings and Coding Families of Sets / Víctor A. Ocasio-González -- On the Behavior of Tile Assembly System at High Temperatures / Shinnosuke Seki and Yasushi Okuno -- Abstract Partial Cylindrical Algebraic Decomposition I: The Lifting Phase / Grant Olney Passmore and Paul B. Jackson -- Multi-valued Functions in Computability Theory / Arno Pauly -- Relative Randomness for Martin-Löf Random Sets / NingNing Peng, Kojiro Higuchi, Takeshi Yamazaki and Kazuyuki Tanaka -- On the Tarski-Lindenbaum Algebra of the Class of all Strongly Constructivizable Prime Models / Mikhail G. Peretyat'kin. |
Record Nr. | UCHICAGO-11076935 |
[Conference on Computability in Europe (8th : 2012 : Cambridge, England)]
![]() |
|
![]() | |
Lo trovi qui: University of Chicago | |
Application and theory of petri nets : 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012. Proceedings / edited by Serge Haddad, Lucia Pomello |
Creatore | [International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency (33rd : 2012 : Hamburg, Germany)] |
Estensione | 1 online resource. |
Accesso persona |
Haddad, Serge
Pomello, Lucia |
Genere/Forma |
Electronic books
Conference papers and proceedings |
Soggetto non controllato |
Computer science
Software engineering Data structures (Computer science) Logic design Computation by Abstract Devices Logics and Meanings of Programs Probability and Statistics in Computer Science Data Structures |
ISBN |
9783642311314
3642311318 9783642311307 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Net Models for Concurrent Object Behaviour / Tony Hoare -- The Theory of WSTS: The Case of Complete WSTS / Alain Finkel and Jean Goubault-Larrecq -- Using Colored Petri Nets to Construct Coalescent Hidden Markov Models: Automatic Translation from Demographic Specifications to Efficient Inference Methods / Thomas Mailund, Anders E. Halager and Michael Westergaard -- An SMT-Based Discovery Algorithm for C-Nets / Marc Solé and Josep Carmona -- Decomposing Process Mining Problems Using Passages / Wil M.P. van der Aalst -- Complexity of the Soundness Problem of Bounded Workflow Nets / Guan Jun Liu, Jun Sun, Yang Liu and Jin Song Dong -- Cost Soundness for Priced Resource-Constrained Workflow Nets / María Martos-Salgado and Fernando Rosa-Velardo -- On the [alpha]-Reconstructibility of Workflow Nets / Eric Badouel -- On Profiles and Footprints -- Relational Semantics for Petri Nets / Matthias Weidlich and Jan Martijn van der Werf -- Data and Abstraction for Scenario-Based Modeling with Petri Nets / Dirk Fahland and Robert Prüfer -- Maximal Confluent Processes / Xu Wang -- Old and New Algorithms for Minimal Coverability Sets / Antti Valmari and Henri Hansen -- Stubborn Sets for Simple Linear Time Properties / Andreas Lehmann, Niels Lohmann and Karsten Wolf.
Hybrid On-the-Fly LTL Model Checking with the Sweep-Line Method / Sami Evangelista and Lars Michael Kristensen -- Safety Slicing Petri Nets / Astrid Rakow -- Capacity Planning for Vertical Search Engines: An Approach Based on Coloured Petri Nets / Veronica Gil-Costa, Jair Lobos, Alonso Inostrosa-Psijas and Mauricio Marin -- An Infrastructure for Cost-Effective Testing of Operational Support Algorithms Based on Colored Petri Nets / Joyce Nakatumba, Michael Westergaard and Wil M.P. van der Aalst -- Designing Weakly Terminating ROS Systems / Debjyoti Bera, Kees M. van Hee and Jan Martijn van der Werf -- Nets-within-Nets to Model Innovative Space System Architectures / Frédéric Cristini and Catherine Tessier -- P- and T-Systems in the Nets-within-Nets-Formalism / Frank Heitmann and Michael Köhler-Bußmeier -- Stochastic Modeling and Analysis Using QPME: Queueing Petri Net Modeling Environment v2.0 / Simon Spinner, Samuel Kounev and Philipp Meier -- Snoopy -- A Unifying Petri Net Tool / Monika Heiner, Mostafa Herajy, Fei Liu, Christian Rohr and Martin Schwarick -- CPN Assistant II: A Tool for Management of Networked Simulations / Štefan Korečko, Ján Marcinčin and Viliam Slodičák. |
Record Nr. | UCHICAGO-11076970 |
[International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency (33rd : 2012 : Hamburg, Germany)]
![]() |
|
![]() | |
Lo trovi qui: University of Chicago | |