Security is one of the most critical factors affecting the quality of urban spaces. Nowadays, most of these spaces have become merely pathways with neither social life nor sense of belonging to it. Insufficiency of public surveillance along with weak sense of control and surveillance results in spaces with high crime rate. In the late 60s and early 70s, high crime statistics in open urban space...

A new method for finding fuzzy optimal solution, the maximum total completion fuzzy time and fuzzy critical path for the given fully fuzzy critical path (FFCP) problems using crisp linear programming (LP) problem is proposed. In this proposed method, all the parameters are represented by triangular fuzzy number. The fuzzy optimal solution of the FFCP problems obtained by the proposed method, do...

Wireless sensor networks demand energy efficient and application specific medium access control protocol when deployed in critical areas which are not frequently accessible. In such areas, the residual energy of nodes also become important along with the efficient data delivery. Many techniques using adaptive duty cycle approach are suggested by researchers to improve the data delivery performa...

This paper extends previous work in value speculation scheduling [14] with an expanded ISA, new recovery code generation methods, and better instruction selection techniques. Our results show that critical instructions are not as predictable as non-critical instructions, instructions at the top of local critical paths have higher predictability than instructions in the middle, and that long-lat...

This paper is an introduction to the problem of Critical Path determination in the context of Timing Veriication. After correct logic veriication, timing is the next most important concern to be addressed by designers. The speed of a circuit is related to the length of the longest path through which a signal can travel, also known as the longest true path or critical path of the circuit. This p...

Problem (JSSP) to evaluate the neighborhoods functions that use the non-deterministic algorithms is the calculation of the critical path in a digraph. This paper presents an experimental study of the cost of computation that exists when the calculation of the critical path in the solution for instances in which a JSSP of large size is involved. The results indicate that if the critical path is ...

The task of finding the crisp critical path has received researcher’s attention over the past two decades which has wide range of applications in planning and scheduling the large projects. In most cases of our life, the data obtained for decision makers are only approximate, which gives rise to fuzzy critical path problem. In this paper, new ranking methods are introduced to identify the fuzzy...

The Critical Path Method (CPM) is useful for planning and control of complex projects. The CPM identifies the critical activities in the critical path of an activity network. The successful implementation of CPM requires the availability of clear determined time duration for each activity. However, in practical situations this requirement is usually hard to fulfill since many of activities will...

This paper presents an algorithm to heuristically partition the data dependence graph representing a basic block or a hyper block of code in order to assign instructions to available processing cores. The algorithm relies on the observation that the critical path in the data dependence graph defines the lower bound on the schedule length of a block and hence the instructions on the critical pat...