We characterize the hitting sets for read-once branching programs of width 3 by a so-called richness condition which is independent of a rather technical definition of branching programs. the richness property proves ...
详细信息
General Game Playing (GGP) is a specially designed environment for creating and testing competitive agents which can play variety of games. the fundamental motivation is to advance the development of various artificia...
详细信息
the traditional client/server architecture for web service delivery fails to naturally scale. this results in growing costs to the service provider for powerful hardware or extensive use of Content Distribution Networ...
详细信息
Recent modeling experiments conducted in computational music give evidence that a number of concepts, methods and tools belonging to inverse semigroup theory can be attuned towards the concrete modeling of time-sensit...
详细信息
ISBN:
(纸本)9783319042978;9783319042985
Recent modeling experiments conducted in computational music give evidence that a number of concepts, methods and tools belonging to inverse semigroup theory can be attuned towards the concrete modeling of time-sensitive interactive systems. Further theoretical developments show that some related notions of higher-dimensional strings can be used as a unifying theme across word or tree automata theory. In this invited paper, we will provide a guided tour of this emerging theory both as an abstract theory and with a view to concrete applications.
this book constitutes the refereed proceedings of the 38th conference on current trends in theory and practice of computer science, SOFSEM 2012, held in Špindlerův Mlýn, Czech Republic, in January 2012. the 43 re...
详细信息
ISBN:
(数字)9783642276606
ISBN:
(纸本)9783642276590
this book constitutes the refereed proceedings of the 38th conference on current trends in theory and practice of computer science, SOFSEM 2012, held in Špindlerův Mlýn, Czech Republic, in January 2012.
the 43 revised papers presented in this volume were carefully reviewed and selected from 121 submissions. the book also contains 11 invited talks, 10 of which are in full-paper length. the contributions are organized in topical sections named: foundations of computerscience; software and Web engineering; cryptography, security, and verification; and artificial intelligence.
Clock synchronization is one of the most basic building blocks for many applications in computerscience and engineering. the purpose of clock synchronization is to provide the constituent parts of a distributed syste...
详细信息
ISBN:
(纸本)9783642112652
Clock synchronization is one of the most basic building blocks for many applications in computerscience and engineering. the purpose of clock synchronization is to provide the constituent parts of a distributed system with a common notion of time. While the problem of synchronizing clocks in distributed systems has already received considerable attention from researchers and practitioners alike, we believe that there are many fascinating problems that remain unsolved. In this paper, we give a brief overview of previous work in this area;followed by a discussion of open clock synchronization problems in theory and practice.
Web science studies the interpay between web technology and the human behaviour it induces at the micro, meso and macro level. In this extended abstract we examine Web science research issues by taking a closer look a...
详细信息
ISBN:
(纸本)9783642112652
Web science studies the interpay between web technology and the human behaviour it induces at the micro, meso and macro level. In this extended abstract we examine Web science research issues by taking a closer look at the area of digital heritage. We discuss engineering, communication and socio-economic aspects.
In this paper we propose a calculus for expressing algorithms for programming languages transformations. We present the type system and operational semantics of the calculus, and we prove that it is type sound. We hav...
详细信息
ISBN:
(纸本)9783030389192;9783030389185
In this paper we propose a calculus for expressing algorithms for programming languages transformations. We present the type system and operational semantics of the calculus, and we prove that it is type sound. We have implemented our calculus, and we demonstrate its applicability with common examples in programming languages. As our calculus manipulates inference systems, our work can, in principle, be applied to logical systems.
We consider infinite two-player games played on finite graphs where the winning condition (say for the first player) is given by a regular omega-language. We address issues of optimization in the construction of winni...
详细信息
ISBN:
(数字)9783540775669
ISBN:
(纸本)9783540775652
We consider infinite two-player games played on finite graphs where the winning condition (say for the first player) is given by a regular omega-language. We address issues of optimization in the construction of winning strategies in such games. Two criteria for optimization are discussed: memory size of finite automata that execute winning strategies, and - for games with liveness requests as winning conditions - "waiting times" for the satisfaction of requests. (For the first aspect we report on work of Holtmann and Loding, for the second on work of Horn., Wallmeier, and the author.)
Probabilistic omega-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word requires that the probabili...
详细信息
ISBN:
(纸本)9783540958901
Probabilistic omega-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word requires that the probability for the accepting runs is positive. In this paper, we provide a summary of the fundamental properties of probabilistic omega-automata concerning expressiveness, efficiency, compositionality and decision problems.
暂无评论