Automated problem solving is viewed typically as the expenditure of computation to solve one or more problems passed to a reasoning system. In response to each problem received, e ort is applied to generate a solution and problem solving ends when the solution is rendered. We discuss the notion of continual computation that addresses a broader conception of problem by considering the ideal use ...

Production environment in modern industries, like integrated circuits manufacturing, fiberglass processing, steelmaking, and ceramic frit, is characterized by zero idle-time between inbound outbound jobs on every machine; this technical requirement improves energy efficiency, hence, has implications for cleaner production other situations. An exhaustive review of literature first conducted to s...

In this paper, we proposed a Power Saving Scheme (PSS) multi-hop sensor network using partition clusters. It avoids collision and idle listening time of sensor nodes for better overall network life time. The basic sensor nodes are simple and have limited power supplies, whereas the cluster head nodes are much more powerful and have many more power supplies, which organize sensors around them in...

One challenging issue of sensor networks is extension of overall network system lifetimes. In periodic data gathering applications, the typical sensor node spends more time in the idle state than active state. Consequently, it is important to decrease power consumption during idle time. In this study, we propose a scheduling scheme based on the history of RTS/CTS exchange during the setup phase...

Channel Bonding (CB) is a technique used to provide larger bandwidth to users. It has been applied to various networks such as wireless local area networks (WLANs), Wireless Sensor Networks (WSNs), Cognitive Radio Networks (CRNs), and Cognitive Radio Sensor Networks (CRSNs). The implementation of CB in CRSNs needs special attention as Primary Radio (PR) nodes traffic must be protected from any ...

We consider an M/M/N/K/FCFS system (N > 0, K ≥N), where the servers operate at (possibly) heterogeneous service rates. In this situation, the steady state behavior depends on the routing policy that is used to select which idle server serves the next job in queue. We define a class of idle-time-order-based policies (including, for example, Longest Idle Server First (LISF)) and show that all pol...

In this paper we analyze energy usage in divisible load processing. Divisible load theory (DLT) applies to computations which can be divided into parts of arbitrary sizes, and the parts can be independently processed in parallel. The shortest schedule for divisible load processing is determined by the speed of computation and communication. Energy usage for such a time-optimum schedule is analy...