Results 1  10
of
760,410
ON STOCHASTIC SCHEDULING WITH INTREE PRECEDENCE CONSTRAINTS
, 1987
"... We consider the problem of optimal scheduling of a set of jobs obeying intree precedence constraints, when a number M of processors is available. It is assumed that the service times of different jobs are independent identically distributed random variables. Subject to a minor assumption on the se ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We consider the problem of optimal scheduling of a set of jobs obeying intree precedence constraints, when a number M of processors is available. It is assumed that the service times of different jobs are independent identically distributed random variables. Subject to a minor assumption
Optimal Parallel Algorithms for Two Processor Scheduling with Tree Precedence Constraints
, 1995
"... Consider the problem of finding a minimum length schedule for n unit execution time tasks on m processors with treelike precedence constraints. A sequential algorithm can solve this problem in linear time. The fastest known parallel algorithm needs O(log n) time using n² processors. For the case m ..."
Abstract
 Add to MetaCart
Consider the problem of finding a minimum length schedule for n unit execution time tasks on m processors with treelike precedence constraints. A sequential algorithm can solve this problem in linear time. The fastest known parallel algorithm needs O(log n) time using n² processors. For the case m
Regression Shrinkage and Selection Via the Lasso
 JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B
, 1994
"... We propose a new method for estimation in linear models. The "lasso" minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant. Because of the nature of this constraint it tends to produce some coefficients that are exactl ..."
Abstract

Cited by 4191 (49 self)
 Add to MetaCart
We propose a new method for estimation in linear models. The "lasso" minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant. Because of the nature of this constraint it tends to produce some coefficients
Large margin methods for structured and interdependent output variables
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2005
"... Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses the complementary ..."
Abstract

Cited by 623 (12 self)
 Add to MetaCart
the complementary issue of designing classification algorithms that can deal with more complex outputs, such as trees, sequences, or sets. More generally, we consider problems involving multiple dependent output variables, structured output spaces, and classification problems with class attributes. In order
Selfadjusting binary search trees
, 1985
"... The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have an am ..."
Abstract

Cited by 431 (18 self)
 Add to MetaCart
sequences, splay trees are as efficient, to within a constant factor, as static optimum search trees. The efftciency of splay trees comes not from an explicit structural constraint, as with balanced trees, but from applying a simple restructuring heuristic, called splaying, whenever the tree is accessed
RapidlyExploring Random Trees: A New Tool for Path Planning
, 1998
"... We introduce the concept of a Rapidlyexploring Random Tree (RRT) as a randomized data structure that is designed for a broad class of path planning problems. While they share many of the beneficial properties of existing randomized planning techniques, RRTs are specifically designed to handle nonho ..."
Abstract

Cited by 397 (19 self)
 Add to MetaCart
We introduce the concept of a Rapidlyexploring Random Tree (RRT) as a randomized data structure that is designed for a broad class of path planning problems. While they share many of the beneficial properties of existing randomized planning techniques, RRTs are specifically designed to handle
Scheduling Jobs with Chain Precedence Constraints
 PARALLEL PROCESSING AND APPLIED MATHEMATICS, PPAM, LNCS 3019
, 2003
"... The problem of scheduling jobs with precedence constraints is studied. A polynomial time approximation scheme is presented for the case when the machines are identical and the precedence graph partitions the jobs into groups of fixed size. As an interesting particular case, this algorithm is a po ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
polynomial time approximation scheme for scheduling jobs with chain or tree precedence constraints on identical machines, when each chain or tree is of constant size. A
RapidlyExploring Random Trees: Progress and Prospects
 Algorithmic and Computational Robotics: New Directions
, 2000
"... this paper, which presents randomized, algorithmic techniques for path planning that are particular suited for problems that involve dierential constraints. ..."
Abstract

Cited by 336 (20 self)
 Add to MetaCart
this paper, which presents randomized, algorithmic techniques for path planning that are particular suited for problems that involve dierential constraints.
ModelChecking in Dense Realtime
 INFORMATION AND COMPUTATION
, 1993
"... Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends on t ..."
Abstract

Cited by 326 (7 self)
 Add to MetaCart
on the magnitudes of the timing delays. For specifications, we extend the syntax of CTL to allow quantitative temporal operators such as 93!5 , meaning "possibly within 5 time units." The formulas of the resulting logic, Timed CTL (TCTL), are interpreted over continuous computation trees, trees in which
Results 1  10
of
760,410