Sciweavers

1647 search results - page 219 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
CCR
2006
122views more  CCR 2006»
15 years 2 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
ALGORITHMICA
2004
125views more  ALGORITHMICA 2004»
15 years 2 months ago
Multidimensional Cube Packing
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa...
149
Voted
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
15 years 6 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
98
Voted
SWAT
2004
Springer
163views Algorithms» more  SWAT 2004»
15 years 7 months ago
New Algorithms for Enumerating All Maximal Cliques
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
Kazuhisa Makino, Takeaki Uno
125
Voted
GECCO
2005
Springer
120views Optimization» more  GECCO 2005»
15 years 8 months ago
Exploiting gradient information in numerical multi--objective evolutionary optimization
Various multi–objective evolutionary algorithms (MOEAs) have obtained promising results on various numerical multi– objective optimization problems. The combination with gradi...
Peter A. N. Bosman, Edwin D. de Jong