Results 1  10
of
19
On the Design of an Adaptive Meeting Scheduler
 In Proc. of the Tenth IEEE Conference on AI Applications
, 1994
"... We present design considerations for an automated meeting scheduling agent that processes meeting requests on behalf of its associated user. In our formulation of the meeting scheduling problem, distributed meeting scheduling agents, one per user, intelligently exchange information with each other t ..."
Abstract

Cited by 26 (5 self)
 Add to MetaCart
We present design considerations for an automated meeting scheduling agent that processes meeting requests on behalf of its associated user. In our formulation of the meeting scheduling problem, distributed meeting scheduling agents, one per user, intelligently exchange information with each other to schedule meetings without compromising userspecified constraints. In this paper, we first enumerate various strategies we have investigated to focus distributed negotiation between scheduling agents. Next, we demonstrate the necessity for such a scheduler to be adaptive in its choice of options for the various strategy dimensions, so that it can perform effectively over time. In order to build an adaptive scheduler that can effectively choose from available strategy options, we develop quantitative performance estimates of these options using detailed probabilistic analysis. Results from these analyses are used to provide guidelines to choose the most appropriate strategy combination give...
A Fast and Practical BitVector Algorithm for the Longest Common Subsequence Problem
 Information Processing Letters
, 2000
"... This paper presents a new practical bitvector algorithm for solving the well known Longest Common Subsequence (LCS) problem. Given two strings of length m and n, n m, we present an algorithm which determines the length p of an LCS in O(nm=w) time and O(m=w) space, where w is the number of bits in a ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
This paper presents a new practical bitvector algorithm for solving the well known Longest Common Subsequence (LCS) problem. Given two strings of length m and n, n m, we present an algorithm which determines the length p of an LCS in O(nm=w) time and O(m=w) space, where w is the number of bits in a machine word. This algorithm can be thought of as columnwise "parallelization" of the classical dynamic programming approach. Our algorithm is very efficiently in practice, where computing the length of an LCS of two strings can be done in linear time and constant (additional/working) space by assuming that m w.
A Trainable Approach To Coreference Resolution For Information Extraction
, 1996
"... This dissertation presents a new approach to solving the coreference resolution problem for a natural language processing (NLP) task known as information extraction. It describes a new system, named resolve, that uses machine learning techniques to determine when two phrases in a text corefer, i.e. ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
This dissertation presents a new approach to solving the coreference resolution problem for a natural language processing (NLP) task known as information extraction. It describes a new system, named resolve, that uses machine learning techniques to determine when two phrases in a text corefer, i.e., refer to the same thing. Resolve can be used as a component within an information extraction system  a system that extracts information automatically from a corpus of texts that all focus on the same topic area  or it can be used as a standalone system to evaluate the relative contribution of different types of knowledge to the coreference resolution process. Resolve represents an improvement over previous approaches to the coreference resolution problem, in that it uses a machine learning algorithm to handle some of the work that had previously been performed manually by a know...
Stochastic monotonicity and realizable monotonicity
, 1999
"... We explore and relate two notions of monotonicity, stochastic and realizable, for a system of probability measures on a common finite partially ordered set (poset) S when the measures are indexed by another poset A. We give counterexamples to show that the two notions are not always equivalent, but ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
We explore and relate two notions of monotonicity, stochastic and realizable, for a system of probability measures on a common finite partially ordered set (poset) S when the measures are indexed by another poset A. We give counterexamples to show that the two notions are not always equivalent, but for various large classes of S we also present conditions on the poset A that are necessary and sufficient for equivalence. When A = S, the condition that the cover graph of S have no cycles is necessary and sufficient for equivalence. This case arises in comparing applicability of the perfect sampling algorithms of Propp and Wilson and the first author of the present paper. Short title. Stochastic and realizable monotonicity.
Adaptive Surrogate Agents
 In Proceedings of the 13th International Distributed Artificial Intelligence Workshop
, 1994
"... Computational infrastructures for cooperative work should contain embedded agents for handling many routine tasks [3], but as the number of agents increases and the agents become geographically and/or conceptually dispersed, supervision of the agents will become increasingly problematic. We argue th ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Computational infrastructures for cooperative work should contain embedded agents for handling many routine tasks [3], but as the number of agents increases and the agents become geographically and/or conceptually dispersed, supervision of the agents will become increasingly problematic. We argue that agents should be provided with deep domain knowledge that allows them to make quantitatively justifiable decisions, rather than shallow models of users to mimic. In this paper, we use the application domain of distributed meeting scheduling to investigate how agents embodying deeper domain knowledge can choose among alternative strategies for searching their calendars in order to create flexible schedules within reasonable cost. In particular, we are interested in developing mechanisms by which agents can adapt their strategy choices to suit the demands imposed by a dynamically changing environment. In this paper, we first enumerate various strategies we have investigated to focus distrib...
MultiPhase Redistribution: A CommunicationEfficient Approach to Array Redistribution
, 1994
"... Distributedmemory implementations of several scientific applications require array redistribution. Array redistribution is used in languages such as High Performance Fortran to dynamically change the distribution of arrays across processors. Performing array redistribution incurs two overheads  an ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Distributedmemory implementations of several scientific applications require array redistribution. Array redistribution is used in languages such as High Performance Fortran to dynamically change the distribution of arrays across processors. Performing array redistribution incurs two overheads  an indexing overhead for determining the set of processors to communicate with and the array elements to be communicated, and a communication overhead for performing the necessary irregular alltomany personalized communication. In this paper efficient runtime methods for performing array redistribution are presented. To reduce the indexing overhead, precise closed forms for enumerating the processors to communicate with and the array elements to be communicated are developed for two special cases of array redistribution involving blockcyclically distributed arrays. The general array redistribution problem for blockcyclically distributed arrays can be expressed in terms of these special case...
Calculating maximumentropy probabilities densities for belief functions
 International Journal of Uncertainty, Fuzziness and KnowledgeBased Systems
, 1994
"... A common procedure for selecting a particular density from a given class of densities is to choose one with maximum entropy. The problem addressed here is this. Let S be a …nite set and let B be a belief function on 2 S. Then B induces a density on 2 S, which in turn induces a host of densities on S ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
A common procedure for selecting a particular density from a given class of densities is to choose one with maximum entropy. The problem addressed here is this. Let S be a …nite set and let B be a belief function on 2 S. Then B induces a density on 2 S, which in turn induces a host of densities on S. Provide an algorithm for choosing from this host of densities one with maximum entropy. 1 Introduction. A common procedure for selecting a particular density from a given class of densities is to choose one with maximum entropy. This situation arises, for example, when the information available is given in the form of a belief function, or equivalently, as probability mass assignments [5], [6]. This gives rise to a set
Measuring Class Cohesion in Java
, 1997
"... Cohesion is an internal software attribute which tells how tightly the components of a software module are bound together in design or implementation. Highly cohesive software modules have a basic function and are difficult to decompose. Cohesion is thought to be a desirable goal in software constru ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Cohesion is an internal software attribute which tells how tightly the components of a software module are bound together in design or implementation. Highly cohesive software modules have a basic function and are difficult to decompose. Cohesion is thought to be a desirable goal in software construction, leading to better values for external attributes such as maintainability, reusability, and reliability. To test this hypothesis, a good measure of class cohesion is needed. We examine the problem of measuring class cohesion in objectoriented systems written in Java. The research utilizes the class cohesion measure as proposed by Bieman and Kang [Bieman95]. The measure counts the proportion of method pairs in a class exhibiting connectedness through the use of one or more common instance variables of that class. For a measure to be valid, it must obey the requirements of measurement theory. The Bieman and Kang cohesion measure is shown to meet in large part the requirements of its emp...
Finding partitions of arguments with Dung’s properties via SCSPs
 In Proc. SAC, 913–919. ACM
, 2011
"... Abstract. Forming coalition structures allows agents to join their forces to achieve a common task. We suggest it would be interesting to look for homogeneous groups which follow distinct lines of thought. For this reason, we extend the Dung Argumentation Framework in order to deal with coalitions o ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. Forming coalition structures allows agents to join their forces to achieve a common task. We suggest it would be interesting to look for homogeneous groups which follow distinct lines of thought. For this reason, we extend the Dung Argumentation Framework in order to deal with coalitions of arguments. The initial set of arguments is partitioned into subsets (or coalitions). Each coalition represents a different line of thought, but all the found coalitions show the same property inherited by Dung, e.g. all the coalitions in the partition are admissible (or conflictfree, complete, stable). Some problems in weighted argumentation are NP complete; we use (soft) constraints as a formal approach to reason about coalitions and to model all these problems in the same framework. Semiring algebraic structures can be used to model different optimization criteria for the obtained coalitions. To implement this mapping and practically find its solutions we use JaCoP, a Java constraint solver, and we test the code over a smallworld network. 1
A Constructive Algorithm for Reversible Logic Synthesis
"... Abstract — This paper presents a constructive synthesis algorithm for any nqubit reversible function. Given any nqubit reversible function, there are N distinct input patterns different from their corresponding outputs, where N ≤ 2 n, and the other (2 n − N) input patterns will be the same as their ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract — This paper presents a constructive synthesis algorithm for any nqubit reversible function. Given any nqubit reversible function, there are N distinct input patterns different from their corresponding outputs, where N ≤ 2 n, and the other (2 n − N) input patterns will be the same as their outputs. We show that this circuit can be synthesized by at most 2n · N ‘(n − 1)’CNOT gates and 4n 2 · N NOT gates. The time complexity of our algorithm has asymptotic upper bound O(n · 4 n). The space complexity of our synthesis algorithm is also O(n · 2 n). The computational complexity of our synthesis algorithm is exponentially lower than the complexity of breadthfirst search based synthesis algorithm. I.