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.)
this proceedings contains 14 papers. this conference represents a strong and reputable academic meeting addressing many research sub-disciplines in computerscience. It brings together the international community with...
ISBN:
(纸本)9781921770036
this proceedings contains 14 papers. this conference represents a strong and reputable academic meeting addressing many research sub-disciplines in computerscience. It brings together the international community with a central location around Australia and New Zealand. the meeting allows academics and researchers to discuss research topics as well as the progress of the field and policies to stimulate its growth. It encourages the dissemination of ideas in an inter-disciplinary and intra-disciplinary fashion. the key terms of this proceedings include ACS, algorithm, Amdahl's law, ARC, complexity, computational game theory, CORE, dominant strategies, ERA, multicore, NICTA, parameterized complexity, paravirtualization, Pollack's rule, RAE, REF, RQF, turbo boost technology, virtual machine, Xen.
To improve the precision of phase difference estimation for sinusoidal signals,a correlation theory-based phase difference estimation method for sinusoidal signals is *** phase estimation is obtained by estimating fre...
详细信息
ISBN:
(纸本)9781509009107
To improve the precision of phase difference estimation for sinusoidal signals,a correlation theory-based phase difference estimation method for sinusoidal signals is *** phase estimation is obtained by estimating frequency based on adaptive notch filter,generating reference signals,and multi-layer sliding cross-correlation between reference signals and sampled *** analysis indicates that the proposed method is not affected by non-integral period of sampled *** validate the proposed method,computer simulations and field experiments are *** results demonstrate that the proposed method has better estimation performance than the discrete Fourier transform method,the data extension-based correlation method and the quadrature delay *** measurement results of Coriolis mass flowmeters verify the effectiveness of the proposed method in practice.
作者：
Liu, HedanXiamen Univ
Tan Kah Kee Coll Sch Informat Sci & Technol Zhangzhou Peoples R China
In view of the current teaching situation of the course "Fundamentals of Programming (C++)", which is characterized by the uneven foundation of students, insufficient traditional teaching resources, and the ...
详细信息
ISBN:
(纸本)9798350334722
In view of the current teaching situation of the course "Fundamentals of Programming (C++)", which is characterized by the uneven foundation of students, insufficient traditional teaching resources, and the need to guide the expansion of knowledge, we analyzed the causes and countermeasures of the teaching pain points and proposed the teaching reform of "BOPPPS teaching practice for the cultivation of application-oriented programming talents from OBE perspective". the program designed a curriculum that focuses on five aspects of students and covers all aspects of their professional skills. the results of students' performance and academic competitions have proved that the teaching effect has been significantly improved and students' ability of application and innovation has been greatly enhanced.
We present a language L which is recognizable by a probabilistic finite automaton (PFA) with probability 1 - epsilon for all epsilon > 0 with O(log(2) n) states, with a deterministic finite automaton (DFA) with 0(n...
详细信息
ISBN:
(数字)9783540361374
ISBN:
(纸本)354000145X
We present a language L which is recognizable by a probabilistic finite automaton (PFA) with probability 1 - epsilon for all epsilon > 0 with O(log(2) n) states, with a deterministic finite automaton (DFA) with 0(n) states, but a quantum finite automaton (QFA) needs at least 2(Omega(n/ log n)) states.
this paper presents a parallel artificial immune system designed for graph coloring. the algorithm is based on the clonal selection principle. Each processor operates on its own pool of antibodies and a migration mech...
详细信息
ISBN:
(数字)9783540775669
ISBN:
(纸本)9783540775652
this paper presents a parallel artificial immune system designed for graph coloring. the algorithm is based on the clonal selection principle. Each processor operates on its own pool of antibodies and a migration mechanism is used to allow processors to exchange information. Experimental results show that migration improves the performance of the algorithm. the experiments were performed using a high performance cluster on a set of well-established graph instances available on the Web.
A fundamental unit of work in programming is the code contribution ("commit") that a developer makes to the code base of the project in work. We use statistical methods to derive a model of the probabilistic...
详细信息
ISBN:
(纸本)9783642358432
A fundamental unit of work in programming is the code contribution ("commit") that a developer makes to the code base of the project in work. We use statistical methods to derive a model of the probabilistic distribution of commit sizes in open source projects and we show that the model is applicable to different project sizes. We use both graphical as well as statistical methods to validate the goodness of fit of our model. By measuring and modeling a fundamental dimension of programming we help improve software development tools and our understanding of software development.
We define two-dimensional rational automata for pictures as an extension of classical finite automata for strings. they are obtained replacing the finite relation computed by the transition function with a rational re...
详细信息
ISBN:
(纸本)9783642358432
We define two-dimensional rational automata for pictures as an extension of classical finite automata for strings. they are obtained replacing the finite relation computed by the transition function with a rational relation computed by a transducer. the model provides a uniform setting for the most important notions, techniques and results presented in the last decades for recognizable two-dimensional languages, and establishes new connections between one- and two-dimensional language theory.
Many recent applications of interest involve self-interested participants. As such participants, termed agents, may manipulate the algorithm for their own benefit, a new challenge emerges: the design of algorithms and...
详细信息
ISBN:
(纸本)3540413480
Many recent applications of interest involve self-interested participants. As such participants, termed agents, may manipulate the algorithm for their own benefit, a new challenge emerges: the design of algorithms and protocols that perform well when the agents behave according to their own self-interest. this led several researchers to consider computational models that are based on a sub-field of game-theory and micro-economics called mechanism design. this paper introduces this topic mainly through examples. It demonstrates that in many cases selfishness can be satisfactorily overcome, surveys some of the recent trends in this area and presents new challenging problems. the paper is mostly based on classic results from mechanism design as well as on recent work by the author and others.
computer game-playing is a challenging topic in artificial intelligence. the recent results by the computer programs DEEP BLUE (1996, 1997) and DEEP JUNIOR (2002) against Kasparov show the power of current game-tree s...
详细信息
ISBN:
(纸本)3540207791
computer game-playing is a challenging topic in artificial intelligence. the recent results by the computer programs DEEP BLUE (1996, 1997) and DEEP JUNIOR (2002) against Kasparov show the power of current game-tree search algorithms in Chess. this success is owed to the fruitful combination of the theoretical development of algorithms and their practical application. As an example of the theoretical development we discuss a game-tree algorithm called Opponent-Model search. In contrast to most current algorithms, this algorithm uses an opponent model to predict the opponent's moves and uses these predictions to lure the opponent into uncomfortable positions. We concentrate on the time complexity of two different implementations of the algorithm and show how these are derived. Moreover, we discuss some possible dangers when applying Opponent-Model search in practice.
暂无评论