Publications related to A ride time-oriented scheduling algorithm for dial-a-ride problems

Fast, quasi-optimal, and pipelined instruction-set extensions

Paolo Ienne, Philip Brisk, Ajay Kumar Verma

Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, the AFUs must satisfy certain constraints in terms of read and write ports betw ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Controller complexity reduction for piecewise affine systems through safe region elimination

Colin Neil Jones, Melanie Nicole Zeilinger

We consider the class of piecewise affine optimal state feedback control laws applied to discrete-time piecewise affine systems, motivated by recent work on the computation of closed-form MPC controllers. The storage demand and complexity of these optimal ...

IEEE2007

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Jean-Yves Le Boudec

Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing it; in most, but not all cases, they are based on the notion of bottlenecks. In spite ...

2007

Lexicographic perturbation for multiparametric linear programming with applications to control

Colin Neil Jones

Optimal control problems for constrained linear systems with a linear cost can be posed as multiparametric linear programs (mpLPs) with a parameter in the cost, or equivalently the right-hand side of the constraints, and solved explicitly offline. Degenera ...

Elsevier2007

Average case analysis of multichannel sparse approximations using p- thresholding

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces

p

-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latte ...

2007

Average case analysis of multichannel sparse approximations using p-thresholding - art. no. 67011X

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latter ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2007

Average case analysis of multichannel thresholding

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latter ...

2007

$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering

Dimitri Nestor Alice Van De Ville

In this work, we propose a new grid conversion algorithm between the hexagonal lattice and the orthogonal (a.k.a. Cartesian) lattice. The conversion process, named

H _{ 2 }

O, is easy to implement and is perfectly reversible using the same algorithm to ...

IEEE2007

Performance of Averaging Algorithms in Time-Varying Networks

Patrick Denantes

We study averaging algorithms in time-varying networks, and means tomeasure their performance. We present sufficient conditions on these algorithms, which ensure they lead to computation at each node, of the global average of measurements provided by each ...

2007

Appliation-oriented sheduling for HPC Grids

Mark Sawley, Trach-Minh Tran, Vincent Keller, Michela Thiémard, Pierre Kuonen

The Intelligent Grid Scheduling Service (ISS) aims at finding an optimally suited computational resource for a given application component. An objective cost model function is used to decide it. It includes information on a parametrization of the component ...

2007

A ride time-oriented scheduling algorithm for dial-a-ride problems

Graph Chatbot

Chat with Graph Search

Fast, quasi-optimal, and pipelined instruction-set extensions

Controller complexity reduction for piecewise affine systems through safe region elimination

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Lexicographic perturbation for multiparametric linear programming with applications to control

Average case analysis of multichannel sparse approximations using p- thresholding

Average case analysis of multichannel sparse approximations using p-thresholding - art. no. 67011X

Average case analysis of multichannel thresholding

$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering

Performance of Averaging Algorithms in Time-Varying Networks

Appliation-oriented sheduling for HPC Grids

Controller complexity reduction for piecewise affine systems through safe region elimination

Average case analysis of multichannel sparse approximations using p- thresholding

$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering

Fast, quasi-optimal, and pipelined instruction-set extensions

Performance of Averaging Algorithms in Time-Varying Networks

Lexicographic perturbation for multiparametric linear programming with applications to control

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Average case analysis of multichannel sparse approximations using p-thresholding - art. no. 67011X

Average case analysis of multichannel thresholding

Appliation-oriented sheduling for HPC Grids