Sciweavers

2370 search results - page 161 / 474
» A Structured Set of Higher-Order Problems
Sort
View
113
Voted
ANOR
2008
69views more  ANOR 2008»
15 years 3 months ago
NP-hardness results for the aggregation of linear orders into median orders
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
Olivier Hudry
111
Voted
DAM
1998
77views more  DAM 1998»
15 years 3 months ago
Optimal Wavelength-routed Multicasting
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...
Bruno Beauquier, Pavol Hell, Stephane Perennes
125
Voted
MICS
2010
124views more  MICS 2010»
14 years 10 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
MP
2008
99views more  MP 2008»
15 years 3 months ago
Efficient robust optimization for robust control with constraints
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
Paul J. Goulart, Eric C. Kerrigan, Daniel Ralph
132
Voted
ICIP
2005
IEEE
16 years 5 months ago
The multiRANSAC algorithm and its application to detect planar homographies
A RANSAC based procedure is described for detecting inliers corresponding to multiple models in a given set of data points. The algorithm we present in this paper (called multiRAN...
Marco Zuliani, Charles S. Kenney, B. S. Manjunath