Results 1  10
of
16,700
An exact approach to early/tardy scheduling with release dates
, 2003
"... An exact approach to early/tardy scheduling with release dates ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
An exact approach to early/tardy scheduling with release dates
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 543 (13 self)
 Add to MetaCart
For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain
An Exact Approach for Structural Damage Assessment
"... An exact approach is proposed for damage identification in statically determinate structures. The contribution of this study is twofold. Firstly, a rigorous disassembly formulation of structural global flexibility matrix is presented based on the matrix spectral decomposition, which can provide an ..."
Abstract
 Add to MetaCart
An exact approach is proposed for damage identification in statically determinate structures. The contribution of this study is twofold. Firstly, a rigorous disassembly formulation of structural global flexibility matrix is presented based on the matrix spectral decomposition, which can provide
A generalized processor sharing approach to flow control in integrated services networks: The singlenode case
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1993
"... The problem of allocating network resources to the users of an integrated services network is investigated in the context of ratebased flow control. The network is assumed to be a virtual circuit, connectionbased packet network. We show that the use of Generalized processor Sharing (GPS), when co ..."
Abstract

Cited by 2010 (5 self)
 Add to MetaCart
, the performance of a singleserver GPS system is analyzed exactly from the standpoint of worstcase packet delay and burstiness when the sources are constrained by leaky buckets. The worstcase session backlogs are also determined. In the sequel to this paper, these results are extended to arbitrary topology
Efficient exact stochastic simulation of chemical systems with many species and many channels
 J. Phys. Chem. A
, 2000
"... There are two fundamental ways to view coupled systems of chemical equations: as continuous, represented by differential equations whose variables are concentrations, or as discrete, represented by stochastic processes whose variables are numbers of molecules. Although the former is by far more comm ..."
Abstract

Cited by 427 (5 self)
 Add to MetaCart
simulation methods to simulate trajectories of discrete, stochastic systems, (methods that are rigorously equivalent to the Master Equation approach) but these do not scale well to systems with many reaction pathways. This paper presents the Next Reaction Method, an exact algorithm to simulate coupled
Planning and acting in partially observable stochastic domains
 ARTIFICIAL INTELLIGENCE
, 1998
"... In this paper, we bring techniques from operations research to bear on the problem of choosing optimal actions in partially observable stochastic domains. We begin by introducing the theory of Markov decision processes (mdps) and partially observable mdps (pomdps). We then outline a novel algorithm ..."
Abstract

Cited by 1095 (38 self)
 Add to MetaCart
for solving pomdps offline and show how, in some cases, a finitememory controller can be extracted from the solution to a pomdp. We conclude with a discussion of how our approach relates to previous work, the complexity of finding exact solutions to pomdps, and of some possibilities for finding approximate
An Exact Approach to Upward Crossing Minimization
"... The upward crossing number problem asks for a drawing of the graph into the plane with the minimum number of edge crossings where the edges are drawn as monotonously increasing curves w.r.t. the yaxis. While there is a large body of work on solving this central graph drawing problem heuristically, ..."
Abstract
 Add to MetaCart
, we present the first approach to solve the problem to proven optimality. Our approach is based on a reformulation of the problem as a boolean formula that can be iteratively tightened and resolved. In our experiments, we show the practical applicability and limits of our approach. Furthermore, we can
an exact approach with stochastic wave functions
, 2000
"... The N boson time dependent problem: ..."
A study of translation edit rate with targeted human annotation
 In Proceedings of Association for Machine Translation in the Americas
, 2006
"... We examine a new, intuitive measure for evaluating machinetranslation output that avoids the knowledge intensiveness of more meaningbased approaches, and the laborintensiveness of human judgments. Translation Edit Rate (TER) measures the amount of editing that a human would have to perform to cha ..."
Abstract

Cited by 583 (9 self)
 Add to MetaCart
We examine a new, intuitive measure for evaluating machinetranslation output that avoids the knowledge intensiveness of more meaningbased approaches, and the laborintensiveness of human judgments. Translation Edit Rate (TER) measures the amount of editing that a human would have to perform
Robust principal component analysis?
 Journal of the ACM,
, 2011
"... Abstract This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a lowrank component and a sparse component. Can we recover each component individually? We prove that under some suitable assumptions, it is possible to recover both the lowrank and the ..."
Abstract

Cited by 569 (26 self)
 Add to MetaCart
rank and the sparse components exactly by solving a very convenient convex program called Principal Component Pursuit; among all feasible decompositions, simply minimize a weighted combination of the nuclear norm and of the 1 norm. This suggests the possibility of a principled approach to robust principal component
Results 1  10
of
16,700