Results 1  10
of
3,089
The Paradyn Parallel Performance Measurement Tools
 IEEE COMPUTER
, 1995
"... Paradyn is a performance measurement tool for parallel and distributed programs. Paradyn uses several novel technologies so that it scales to long running programs (hours or days) and large (thousand node) systems, and automates much of the search for performance bottlenecks. It can provide precise ..."
Abstract

Cited by 447 (39 self)
 Add to MetaCart
. The instrumentation is controlled by the Performance Consultant module, that automatically directs the placement of instrumentation. The Performance Consultant has a welldefined notion of performance bottlenecks and program structure, so that it can associate bottlenecks with specific causes and specific parts of a
On the Resemblance and Containment of Documents
 In Compression and Complexity of Sequences (SEQUENCES’97
, 1997
"... Given two documents A and B we define two mathematical notions: their resemblance r(A, B)andtheircontainment c(A, B) that seem to capture well the informal notions of "roughly the same" and "roughly contained." The basic idea is to reduce these issues to set intersection probl ..."
Abstract

Cited by 506 (6 self)
 Add to MetaCart
Given two documents A and B we define two mathematical notions: their resemblance r(A, B)andtheircontainment c(A, B) that seem to capture well the informal notions of "roughly the same" and "roughly contained." The basic idea is to reduce these issues to set intersection
Global Optimization with Polynomials and the Problem of Moments
 SIAM JOURNAL ON OPTIMIZATION
, 2001
"... We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear ma ..."
Abstract

Cited by 577 (48 self)
 Add to MetaCart
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear
Fixing the Java memory model
 In ACM Java Grande Conference
, 1999
"... This paper describes the new Java memory model, which has been revised as part of Java 5.0. The model specifies the legal behaviors for a multithreaded program; it defines the semantics of multithreaded Java programs and partially determines legal implementations of Java virtual machines and compile ..."
Abstract

Cited by 385 (10 self)
 Add to MetaCart
and compilers. The new Java model provides a simple interface for correctly synchronized programs – it guarantees sequential consistency to dataracefree programs. Its novel contribution is requiring that the behavior of incorrectly synchronized programs be bounded by a well defined notion of causality
Between MDPs and SemiMDPs: A Framework for Temporal Abstraction in Reinforcement Learning
, 1999
"... Learning, planning, and representing knowledge at multiple levels of temporal abstraction are key, longstanding challenges for AI. In this paper we consider how these challenges can be addressed within the mathematical framework of reinforcement learning and Markov decision processes (MDPs). We exte ..."
Abstract

Cited by 569 (38 self)
 Add to MetaCart
extend the usual notion of action in this framework to include optionsclosedloop policies for taking action over a period of time. Examples of options include picking up an object, going to lunch, and traveling to a distant city, as well as primitive actions such as muscle twitches and joint knowledge
Qualitative process theory
 MIT AI Lab Memo
, 1982
"... Objects move, collide, flow, bend, heat up, cool down, stretch, compress. and boil. These and other things that cause changes in objects over time are intuitively characterized as processes. To understand commonsense physical reasoning and make programs that interact with the physical world as well ..."
Abstract

Cited by 899 (92 self)
 Add to MetaCart
as people do we must understand qualitative reasoning about processes, when they will occur, their effects, and when they will stop. Qualitative process theory defines a simple notion of physical process that appears useful as a language in which to write dynamical theories. Reasoning about processes also
Querying objectoriented databases
 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1992
"... We present a novel language for querying objectoriented databases. The language is built around the idea of extended path expressions that substantially generalize [ZAN83], and on an adaptation of the firstorder formalization of objectoriented languages from [KW89, KLW90, KW92]. The language inco ..."
Abstract

Cited by 492 (6 self)
 Add to MetaCart
the system tables that store schema information. ffl The notions of a type and typecorrectness have precise meaning. It accommodates a wide variety of queries that might be deemed well or illtyped under different circumstances. In particular, we show that there is more than one way of settling the issue
On WellDefined Kinematic Metric Functions
"... Abstract This paper presents both formal as well as practical welldefinedness conditions for kinematic metric functions. To formulate these conditions, we introduce an intrinsic definition of a rigid body's configuration space. Based on this definition, the principle of objectivity is introd ..."
Abstract
 Add to MetaCart
is introduced to derive a formal condition for welldefinedness of kinematic metric functions, as well as to gain physical insight into left, right and biinvariances on the Lie group SE(3). We then relate the abstract notion of objectivity to the more intuitive notion of frameinvariance, and show that frame
SUS: A quick and dirty usability scale
, 1996
"... Usability does not exist in any absolute sense; it can only be defined with reference to particular contexts. This, in turn, means that there are no absolute measures of usability, since, if the usability of an artefact is defined by the context in which that artefact is used, measures of usability ..."
Abstract

Cited by 397 (1 self)
 Add to MetaCart
general quality of the appropriateness to a purpose of any particular artefact. This notion is neatly summed up by Terry Pratchett in his novel “Moving Pictures”: “ „Well, at least he keeps himself fit, ‟ said the Archchancellor nastily. „Not like the rest of you fellows. I went into the Uncommon Room
Probabilistic Approximation of Metric Spaces and its Algorithmic Applications
 In 37th Annual Symposium on Foundations of Computer Science
, 1996
"... The goal of approximating metric spaces by more simple metric spaces has led to the notion of graph spanners [PU89, PS89] and to lowdistortion embeddings in lowdimensional spaces [LLR94], having many algorithmic applications. This paper provides a novel technique for the analysis of randomized ..."
Abstract

Cited by 351 (32 self)
 Add to MetaCart
algorithms for optimization problems on metric spaces, by relating the randomized performance ratio for any metric space to the randomized performance ratio for a set of "simple" metric spaces. We define a notion of a set of metric spaces that probabilisticallyapproximates another metric space
Results 1  10
of
3,089