Titlebook: SOFSEM 2001: Theory and Practice of Informatics; 28th Conference on C Leszek Pacholski,Peter Ru?i?ka Conference proceedings 2001 Springer-V

Orgasm

Beyond the Turing Limit: Evolving Interactive Systemsctionality may change over time as components enter or disappear. Also, as a rule their components interact with each other and with the environment at unpredictable times and in unpredictable manners, and they evolve in ways that are not pre-programmed. Finally, although the life span of the indivi

Infirm

Formal Verification Methods for Industrial Hardware Designquent software releases; however, fixing hardware bugs in any shipped product is expensive. Simulation remains the dominate functional validation method, but in the last decade, formal verification (FV) has emerged as an important complementary method. We describe basic FV methods: theorem proving,

immunity

How Can Computer Science Contribute to Knowledge Discoveryields including computer science. Good softwares have been demanded for various knowledge discovery tasks. For such softwares, we often need to develop efficient algorithms for handling huge data sets. . is one of the important algorithmic methods for processing huge data sets. In this paper, we exp

fastness

Model Checking Communication Protocolseveral different communication protocols can be specified with this simple model. In this paper we address the problem of automatically validating protocols by verifying properties such as well-formedness and absence of deadlock. Our method is based on a representation of communicating finite-state

vector

Pipelined Decomposable BSP Computers computations. We prove that a modification of the bulk synchronous parallel (BSP) machine model, called decomposable BSP (dBSP), belongs to the class of weak parallel machines if its computational power is restricted properly. We will also correct some earlier results about pipelined parallel Turin

中和

魅力

開花期女

預防注射

ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costsputing environment made up by a collection of computers connected through a high speed network. In this paper we propose an order preserving SDDS with a worst-case constant cost for exact-search queries and a worst-case logarithmic cost for update queries. Since our technique preserves the ordering

撕裂皮肉

Approximative Learning of Regular Languagesave been exploited to design regular lan- guage classes called . -distinguishable which are identifiable in the limit from positive samples. Special cases of this approach are the . -reversible and terminal distinguishable languages as discussed in [., ., ., ., .].Here, we give new characterizations