6111 search results - page 18 / 1223 » Time, Hardware, and Uniformity |
130
click to vote
WG
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
148
click to vote
WSC
2008
15 years 4 months ago
2008
Staffing and scheduling optimization in large multiskill call centers is time-consuming, mainly because it requires lengthy simulations to evaluate performance measures and their ...
121
click to vote
JDA
2006
15 years 1 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
116
click to vote
TCS
1998
15 years 1 months ago
1998
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
108
click to vote
ICCAD
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper, we present a reduced order inodeling methodology, based on the utilization of optimal non-uniform grids generated by Gaussian spectral rules, for the direct passive...