succeeds only when networks begin with limited working memory and gradually ‘mature ’ to the adult state. This result suggests that rather than being a limitation, developmental restrictions on resources may constitute a necessary prerequisite for mastering certain complex domains. Specifically, successful

, reactive programs that must operate with severe memory and power constraints. nesC’s contribution is to support the special needs of this domain by exposing a programming model that incorporates event-driven execution, a flexible concurrency model, and component-oriented application design. Restrictions

We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite automata. We generate a set of biased sequences by applying a finite state automata with a specified number, m, of states to the set of all binary sequences. Thus we can index the complexity of our random sequence by the number of states of the automata. We detail optimal algorithms to predict sequences generated in this way.

The paper presents exact schedulability analyses for real-time systems scheduled at run-time with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions

This paper describes a system for the evolution and co-evolution of virtual creatures that compete in physically simulated three-dimensional worlds. Pairs of individuals enter one-on-one contests in which they contend to gain control of a common resource. The winners receive higher relative fitness

A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization

In this paper, we study cross-layer design for congestion control in multihop wireless networks. In previous work, we have developed an optimal cross-layer congestion control scheme that jointly computes both the rate allocation and the stabilizing schedule that controls the resources

is the freedom from time and space constraints. If resources are limited and response time is critical, as it is typically the case for both or-ganisms and robots, then it is far from clear that conventional computing methods are the most suitable

In this paper we study the properties of complex systems based on replicator dynamics. Vector field analysis is used to reveal new properties of the dynamical system. Spectral problem has been considered and Lyaponov function has been derived from the algebraic properties of the system under consideration. New mathematical model with multi-agent interaction is developed and general properties of such model are discussed. The over-all dynamics can be understood by means of mathematical modeling of replicator equations and corresponding multi-agent system. The dynamics of multi agent system depends crucially on the interaction between agents and it is quite different from the dynamics of corresponding independent agents.

Abstract—The aim of our research is to develop domain-restricted resources for web interaction supporting different languages: English, Hindi and Spanish. Many practical natural language systems use linguistic resources adapted to a specific domain because the processing is faster and more robust