Sciweavers

389 search results - page 14 / 78
» Some natural decision problems in automatic graphs
Sort
View
ASIAN
2004
Springer
109views Algorithms» more  ASIAN 2004»
14 years 23 days ago
Online Stochastic and Robust Optimization
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Russell Bent, Pascal Van Hentenryck
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
13 years 8 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
ISPAN
2002
IEEE
14 years 8 days ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
IJCNN
2008
IEEE
14 years 1 months ago
Including multi-objective abilities in the Hybrid Intelligent Suite for decision support
— Hybrid intelligent systems (HIS) are very successful in tackling problems comprising of more than one distinct computational subtask. For instance, decision-making problems are...
Diogo Ferreira Pacheco, Flávio R. S. Olivei...
WIRN
2005
Springer
14 years 25 days ago
Recursive Neural Networks and Graphs: Dealing with Cycles
Recursive neural networks are a powerful tool for processing structured data. According to the recursive learning paradigm, the input information consists of directed positional ac...
Monica Bianchini, Marco Gori, Lorenzo Sarti, Franc...