Sciweavers

656 search results - page 101 / 132
» Minimal non-convex words
Sort
View
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
14 years 9 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 ...
ANOR
2004
122views more  ANOR 2004»
14 years 9 months ago
Call Center Staffing with Simulation and Cutting Plane Methods
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...
Júlíus Atlason, Marina A. Epelman, S...
CSUR
2004
91views more  CSUR 2004»
14 years 9 months ago
Line drawing, leap years, and Euclid
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
Mitchell A. Harris, Edward M. Reingold
CN
2002
106views more  CN 2002»
14 years 9 months ago
Quality of service and flow level admission control in the Internet
We propose to apply an integrated admission control scheme to both streaming flows and elastic flows. It is assumed that streaming flow packets are served with priority in network...
Nabil Benameur, Slim Ben Fredj, Sara Oueslati-Boul...
DAM
2000
137views more  DAM 2000»
14 years 9 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...