Results 1  10
of
3,310
Constrained output pathfollowing for nonlinear systems using predictive control
 In Proc. of 8th IFAC Symposium on Nonlinear Control Systems (NOLCOS
, 2010
"... Abstract: We address the problem of steering the output of a nonlinear system along a given parametrized reference path, taking input and state constraints into account. Such problems are known as output pathfollowing problems, which typically arise in vehicle and robot control and also in process ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract: We address the problem of steering the output of a nonlinear system along a given parametrized reference path, taking input and state constraints into account. Such problems are known as output pathfollowing problems, which typically arise in vehicle and robot control and also in process
Finding the k Shortest Paths
, 1997
"... We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest pat ..."
Abstract

Cited by 401 (2 self)
 Add to MetaCart
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest
Prices and unit labor costs: A new test of price stickiness
, 1999
"... This paper investigates the predictions of a simple optimizing model of nominal price rigidity for the aggregate price level and the dynamics of inflation. I compare the model’s predictions with those of a perfectly competitive, flexible price ‘benchmark’ model (corresponding to the model of pricing ..."
Abstract

Cited by 356 (11 self)
 Add to MetaCart
productivity, and output, I determine the implied path of prices predicted by the model. Because prices are not a stationary series, I present my results in terms of the predicted path of the price/unit labor cost ratio, where the parameters characterizing such paths are chosen to maximize the fit
Holistic twig joins: optimal XML pattern matching
 in: Proceedings of ACM SIGMOD International Conference on Management of Data, 2002
"... XML employs a treestructured data model, and, naturally, XML queries specify patterns of selection predicates on multiple elements related by a tree structure. Finding all occurrences of such a twig pattern in an XML database is a core operation for XML query processing. Prior work has typically de ..."
Abstract

Cited by 344 (8 self)
 Add to MetaCart
of this approach for matching twig patterns is that intermediate result sizes can get large, even when the input and output sizes are more manageable. In this paper, we propose a novel holistic twig join algorithm, TwigStack, for matching an XML query twig pattern. Our technique uses a chain of linked stacks
The stages of economic growth.
 Economic History Review , 2nd series 12,
, 1959
"... JSTOR is a notforprofit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about J ..."
Abstract

Cited by 297 (0 self)
 Add to MetaCart
the conventional limits on the theory of production are widened, it is possible to define theoretical equilibrium positions not only for output, investment, and consumption as a whole, but for each sector of the economy.1 Within the framework set by forces determining the total level of output, THE ECONOMIC
Finding Consensus in Speech Recognition: Word Error Minimization and Other Applications of Confusion Networks
, 2000
"... We describe a new framework for distilling information from word lattices to improve the accuracy of speech recognition and obtain a more perspicuous representation of a set of alternative hypotheses. In the standard MAP decoding approach the recognizer outputs the string of words corresponding ..."
Abstract

Cited by 246 (14 self)
 Add to MetaCart
We describe a new framework for distilling information from word lattices to improve the accuracy of speech recognition and obtain a more perspicuous representation of a set of alternative hypotheses. In the standard MAP decoding approach the recognizer outputs the string of words corresponding
Output
"... The application of Six Sigma always involves the implementation of a path: that is, the development of a coherent set of activities that together help to achieve one or more planned results (see Section 1.3.2). On the other hand, Six Sigma projects always involve one or more business processes and r ..."
Abstract
 Add to MetaCart
The application of Six Sigma always involves the implementation of a path: that is, the development of a coherent set of activities that together help to achieve one or more planned results (see Section 1.3.2). On the other hand, Six Sigma projects always involve one or more business processes
Output: Minimal Path
"... Closed Contour segmentation as a set of minimal paths in 2D Geodesic meshing for 3D surface segmentation ..."
Abstract
 Add to MetaCart
Closed Contour segmentation as a set of minimal paths in 2D Geodesic meshing for 3D surface segmentation
Threads and Input/Output in the Synthesis kernel
 In Proceedings of the 12th ACM Symposium on Operating Systems Principles
, 1989
"... The Synthesis operating system kernel combines several techniques to provide high performance, including kernel code synthesis, negrain scheduling, and optimistic synchronization. Kernel code synthesis reduces the execution path for frequently used kernel calls. Optimistic synchronization increases ..."
Abstract

Cited by 112 (14 self)
 Add to MetaCart
The Synthesis operating system kernel combines several techniques to provide high performance, including kernel code synthesis, negrain scheduling, and optimistic synchronization. Kernel code synthesis reduces the execution path for frequently used kernel calls. Optimistic synchronization
OutputSensitive Reporting of Disjoint Paths
, 1996
"... A kpath query on a graph consists of computing k vertexdisjoint paths between two given vertices of the graph, whenever they exist. In this paper, we study the problem of performing kpath queries, with k < 3, in a graph G with n vertices. We denote with the total length of the paths reported. ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
. For k < 3, we present an optimal data structure for G that uses O(n) space and executes kpath queries in outputsensitive O() time. For triconnected planar graphs, our results make use of a new combinatorial structure that plays the same role as bipolar (st) orientations for biconnected planar
Results 1  10
of
3,310