Results 1 - 10 of 800

Algorithms for Constraint-Satisfaction Problems: A Survey

by Vipin Kumar , 1992
"... A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments, an ..."
Abstract - Cited by 449 (0 self) - Add to MetaCart
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments

Manetho: Transparent Rollback-Recovery with Low Overhead, Limited Rollback and Fast Output Commit

by Elmootazbellah N. Elnozahy, Willy Zwaenepoel - IEEE TRANSACTIONS ON COMPUTERS , 1992
"... Manetho is a new transparent rollback-recovery protocol for long-running distributed computations. It uses a novel combination of antecedence graph maintenance, uncoordinated checkpointing, and sender-based message logging. Manetho simultaneously achieves the advantages of pessimistic message loggin ..."
Abstract - Cited by 209 (11 self) - Add to MetaCart
Manetho is a new transparent rollback-recovery protocol for long-running distributed computations. It uses a novel combination of antecedence graph maintenance, uncoordinated checkpointing, and sender-based message logging. Manetho simultaneously achieves the advantages of pessimistic message

Concern Graphs: Finding and Describing Concerns

by Martin P. Robillard, Gail C. Murphy , 2002
"... Many maintenance tasks address concerns, or features, that are not well modularized in the source code comprising a system. Existing approaches available to help software developers locate and manage scattered concerns use a representation based on lines of source code, complicating the analysis of ..."
Abstract - Cited by 209 (14 self) - Add to MetaCart
Many maintenance tasks address concerns, or features, that are not well modularized in the source code comprising a system. Existing approaches available to help software developers locate and manage scattered concerns use a representation based on lines of source code, complicating the analysis

A Safe, Efficient Regression Test Selection Technique

by Gregg Rothermel , Mary Jean Harrold - ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY , 1997
"... Regression testing is an expensive but necessary maintenance activity performed on modified software to provide confidence that changes are correct and do not adversely affect other portions of the software. A regression test selection technique chooses, from an existing test set, tests that are d ..."
Abstract - Cited by 227 (65 self) - Add to MetaCart
Regression testing is an expensive but necessary maintenance activity performed on modified software to provide confidence that changes are correct and do not adversely affect other portions of the software. A regression test selection technique chooses, from an existing test set, tests

Replicated Distributed Processes in Manetho

by Elmootazbellah N. Elnozahy , Willy Zwaenepoel
"... This paper presents the process-replication protocol of Manetho, a system whose goal is to provide efficient, application-transparent fault tolerance to long-running distributed computations. Manetho uses a new negative-acknowledgment multicast protocol to enforce the same receipt order of applicati ..."
Abstract - Cited by 27 (7 self) - Add to MetaCart
of application messages among all replicas of a process. The protocol depends on a combination of antecedence graph maintenance, a form of sender-based message logging, and the fact that the receivers of each multicast execute the same deterministic program. This combination allows our protocol to avoid

A Cluster-based Approach for Routing in Dynamic Networks

by P. Krishna, N.H. Vaidya, M. Chatterjee, D. K. Pradhan - ACM SIGCOMM Computer Communication Review , 1997
"... The design and analysis of routing protocols is an important issue in dynamic networks such as packet radio and ad-hoc wireless networks. Most conventional protocols exhibit their least desirable behavior for highly dynamic interconnection topologies. We propose a new methodology for routing and top ..."
Abstract - Cited by 180 (3 self) - Add to MetaCart
and topology information maintenance in dynamic networks. The basic idea behind the protocol is to divide the graph into a number of overlapping clusters. A change in the network topology corresponds to a change in cluster membership. We present algorithms for creation of clusters, as well as algorithms

Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks

by Ivan Stojmenovic, Mahtab Seddigh, Jovisa Zunic - IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS , 2002
"... In a multihop wireless network, each node has a transmission radius and is able to send a message to all of its neighbors that are located within the radius. In a broadcasting task, a source node sends the same message to all the nodes in the network. In this paper, we propose to significantly redu ..."
Abstract - Cited by 174 (15 self) - Add to MetaCart
reduce or eliminate the communication overhead of a broadcasting task by applying the concept of localized dominating sets. Their maintenance does not require any communication overhead in addition to maintaining positions of neighboring nodes. Retransmissions by only internal nodes in a dominating set

Consistency of Clark's Completion and Existence of Stable Models

by François Fages , 1994
"... The most general notion of canonical model for a logic program with negation is the one of stable model [9]. In [7] the stable models of a logic program are characterized by the well-supported Herbrand models of the program, and a new fixed point semantics that formalizes the bottom-up truth mainten ..."
Abstract - Cited by 170 (2 self) - Add to MetaCart
maintenance procedure of [4] is based on that characterization. Here we focus our attention on the abstract notion of well-supportedness in order to derive sufficient conditions for the existence of stable models. We show that if a logic program \Pi is positive-order-consistent (i.e. there is no infinite

Case Study of Feature Location Using Dependence Graph

by Kunrong Chen, Václav Rajlich - In Proceedings of the 8th International Workshop on Program Comprehension , 2000
"... Software change requests are often formulated as requests to modify or to add a specific feature or concept. To implement these changes, the features or concepts must be located in the code. In this paper, we describe the scenarios of the feature and concept location. The scenarios utilize a compute ..."
Abstract - Cited by 117 (12 self) - Add to MetaCart
computer-assisted search of software dependence graph. Scenarios are demonstrated by a case study of NCSA Mosaic source code. 1. Introduction In software maintenance and evolution, change requirements are often formulated as requests to modify or to add specific program concepts or features [2, 26

Using slicing to identify duplication in source code

by Raghavan Komondoor, Susan Horwitz - IN PROCEEDINGS OF THE 8TH INTERNATIONAL SYMPOSIUM ON STATIC ANALYSIS , 2001
"... Programs often have a lot of duplicated code, which makes both understanding and maintenance more difficult. This problem can be alleviated by detecting duplicated code, extracting it into a separate new procedure, and replacing all the clones (the instances of the duplicated code) by calls to the ..."
Abstract - Cited by 150 (4 self) - Add to MetaCart
Programs often have a lot of duplicated code, which makes both understanding and maintenance more difficult. This problem can be alleviated by detecting duplicated code, extracting it into a separate new procedure, and replacing all the clones (the instances of the duplicated code) by calls
Results 1 - 10 of 800