With the assignment of the last available blocks of public IPv4 addresses from Internet Assigned Numbers Authority, there is continued pressure for widespread IPv6 adoption. Because the IPv6 address space is orders of magnitude larger than the IPv4 address space, researchers need new methods and techniques to accurately measure and characterize growth in IPv6. This thesis focuses on IPv6 router...

Heuristic Search techniques are known for their efficiency and effectiveness in solving NP-Hard problems. However, there has been limited success so far in constructing a software toolkit which is dedicated to these methods and can fully support all the stages and aspects of researching and developing a system based on these techniques. Some of the reasons for that include the lack of problem m...

Uninformed or blind search, which processes and evaluates all nodes of a search space in the worst case, is not realistic for extracting knowledge from large data sets because of time constraints that are close related to the dimension of the data. Generally, the search space increases exponentially with problem size thereby limiting the size of problems which can realistically be solved using ...

 Abstract : In this paper a meta-heuristic approach has been presented to solve lot-size determination problems in a complex multi-stage production planning problems with production capacity constraint. This type of problems has multiple products with sequential production processes which are manufactured in different periods to meet customer’s demand. By determining the decision variables, mac...

Hyper-heuristics can be identified as methodologies that search the space generated by a finite set of low level heuristics for solving search problems. An iterative hyper-heuristic framework can be thought of as requiring a single candidate solution and multiple perturbation low level heuristics. An initially generated complete solution goes through two successive processes (heuristic selectio...

In this chapter, an exhaustive survey of quantum behaved techniques on swarm intelligent is presented. The techniques have been categorized into different classes, and in conclusion, a comparison is made according to the benefits of the approaches taken for review. The above-mentioned techniques are classified based on the information they exploit, for instance, neural network related, meta-heu...

In this paper, three iterative improvement methods, simulated annealing, genetic algorithm and tabu search, are proposed to search for solutions to network planning problems. Then, a brief summary of the heuristic methods, single-stage optimization methods, time-phased optimization methods, artificial intelligence techniques and iterative improvement methods are presented. Finally, the performa...

This paper focuses on evaluation techniques for multimodal software. We suggest how multimodal educational systems can help us and give a proposal for how to evaluate these systems. Our goal is to come up with human-computer interaction (HCI) evaluation techniques for multimodal systems to support affective education and adapt usability evaluation taking into consideration the cognitive walkthr...

Solving scheduling problems with Constraint Satisfaction Problems (CSP’s) techniques implies a wide space search with a large number of variables, each one of them with a wide interpretation domain. This paper discusses the application of CSP heuristic techniques (based on the concept of slack of activities) for variable and value ordering on a special type of job-shop scheduling problems in wh...

This abstract discusses work looking into techniques for improving the quality of the search heuristics used to guide forward-chaining planning. The improvements in heuristic quality are made by performing a static analysis of the planning problem to identify commonly occurring ‘generic types’, and providing additional heuristic guidance based on their known properties. In doing so, the heurist...