Sciweavers

790 search results - page 75 / 158
» Subexponential Parameterized Algorithms
Sort
View
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
15 years 3 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
INFOCOM
2006
IEEE
15 years 9 months ago
Optimal Scheduling Algorithms for Input-Queued Switches
— The input-queued switch architecture is widely used in Internet routers, due to its ability to run at very high line speeds. A central problem in designing an input-queued swit...
Devavrat Shah, Damon Wischik
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
15 years 6 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
15 years 3 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
ALT
2004
Springer
16 years 4 days ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster