Sciweavers

Share
JDA
2010
88views more  JDA 2010»
8 years 12 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
SIGMETRICS
2002
ACM
106views Hardware» more  SIGMETRICS 2002»
9 years 1 months ago
Analysis of methods for scheduling low priority disk drive tasks
This paper analyzes various algorithms for scheduling low priority disk drive tasks. The derived closed form solution is applicable to class of greedy algorithms that include a va...
Eitan Bachmat, Jiri Schindler
MP
1998
108views more  MP 1998»
9 years 1 months ago
Base polytopes of series-parallel posets: Linear description and optimization
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
Rainer Schrader, Andreas S. Schulz, Georg Wambach
JAT
2007
84views more  JAT 2007»
9 years 1 months ago
On Lebesgue-type inequalities for greedy approximation
We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and th...
David L. Donoho, Michael Elad, Vladimir N. Temlyak...
JCO
2006
234views more  JCO 2006»
9 years 1 months ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
JAT
2006
64views more  JAT 2006»
9 years 1 months ago
Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm
Opposed to linear schemes, nonlinear function approximation allows to obtain a dimension independent rate of convergence. Unfortunately, in the presence of data noise typical algo...
Andreas Hofinger
IPL
2008
61views more  IPL 2008»
9 years 1 months ago
Online chasing problems for regular polygons
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...
Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa
ENDM
2006
127views more  ENDM 2006»
9 years 1 months ago
Greedy defining sets in graphs and Latin squares
Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
Manouchehr Zaker
COMBINATORICS
2006
92views more  COMBINATORICS 2006»
9 years 1 months ago
Equitable Matroids
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
Dillon Mayhew
DM
2008
112views more  DM 2008»
9 years 1 months ago
On the vertices of the k-additive core
The core of a game v on N, which is the set of additive games dominating v such that (N) = v(N), is a central notion in cooperative game theory, decision making and in combinator...
Michel Grabisch, Pedro Miranda
books