Maintenance and evolution are critical for website since the requirements often change, the developing cycle is short, while the life cycle is long. In order to make progress in this area, we focus on the users' r...
详细信息
ISBN:
(纸本)0769519105
Maintenance and evolution are critical for website since the requirements often change, the developing cycle is short, while the life cycle is long. In order to make progress in this area, we focus on the users' responses and attitudes. So we begin our work at the log files on the side of website server, gathering the users' visiting information and the server's responses. Thus we obtain our weighted structure model. Then, we analyze and discuss such information to identify the key pages, the predominate pages and the users' visiting patterns. And we can improve the testing efficiency based on these knowledge. All these will help to improve the structure of the site, fulfill the functionality of the site, and enhance users' visiting efficiency.
A number of empirical studies using students as subjects has been carried out in the last few years. These studies are usually conducted as pilot experiments that allow researchers to fine-tune an experiment before de...
详细信息
Experience using constraint programming to solve real-life problems has shown that finding an efficient solution to the problem often requires experimentation with different constraint solvers or even building a probl...
详细信息
In industrial interdisciplinary projects where engineers of different sorts have to work together, a framework is necessary in order to support such an interdisciplinary development process. For example, the design in...
Two of the fundamental issues in message passing between mobile agents are tracking the migration of the target agent and delivering messages to it. In order to provide reliable message delivery, protocols are needed ...
详细信息
This workshop was dedicated to research towards better support for unanticipated software evolution (USE) in development tools, programming languages, component models and related runtime *** report gives an overview ...
详细信息
This paper presents the design and evaluation of a manufacturing route planner for flexible manufacturing systems. The aim of the planner is to find the optimal manufacturing routes for jobs using well-designed cost f...
详细信息
This paper presents the design and evaluation of a manufacturing route planner for flexible manufacturing systems. The aim of the planner is to find the optimal manufacturing routes for jobs using well-designed cost functions. This route planner, which is based on heuristic [A*] strategy, has been designed to work under dynamic arrival pattern environment. The proposed algorithm consists of two level;the cell level, which controls the jobs flow between cells, and the machine level which controls the jobs flow between the machines inside the cells selected at first level. The solutions of the route planner are contained in a dynamic knowledge base that passes information to the sequencing and monitoring stage. The suggested model has also the capability to detect and response with suitable alternation for the damaged elements in the manufacturing system. To improve the performance of the planner, the design is organized into distributed programming media using the concurrent features of the modula-2 programming language. Finally, two case studies are considered to illustrate the functionality of the proposed algorithm.
Propositional satisfiability (SAT) is a fundamental problem of immense practical importance. While SAT is NP-complete when clauses can contain 3 literals or more, the problem can be solved in linear time when the give...
详细信息
ISBN:
(纸本)0909925828
Propositional satisfiability (SAT) is a fundamental problem of immense practical importance. While SAT is NP-complete when clauses can contain 3 literals or more, the problem can be solved in linear time when the given formula contains only binary clauses (2SAT). Many complete search algorithms for SAT solving have taken advantage of 2SAT information that occurs in the statement of the problem in order to simplify the solving process, only one that we are aware of uses 2SAT information that arises in the process of the search, as clauses are simplified. There are a number of possibilities for making use of 2SAT information to improve the SAT solving process: maintaining 2SAT satisfiability during search, detecting unit consequences of the 2SAT clauses, and Krom subsumption using 2SAT clauses. In this paper we investigate the tradeoffs of increasing complex 2SAT handling versus the search space reduction and execution time. We give experimental results illustrating that the SAT solver resulting from the best tradeoff is competitive with state of the art Davis-Putnam methods, on hard problems involving a substantial 2SAT component.
暂无评论