14165 search results - page 530 / 2833 » The generalized two-server problem |
200
click to vote
ESA
2004
Springer
16 years 12 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
179
click to vote
TALG
2010
15 years 5 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
206
click to vote
ACMICEC
2003
ACM
16 years 8 days ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
182
click to vote
ICCAD
1994
IEEE
15 years 11 months ago
1994
IEEE
We consider the problem of performance driven lookup-table (LUT) based technology mapping for FPGAs using a general delay model. In the general delay model, each interconnection e...
177
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
We consider a network composed of two interfering point-to-point links where the two transmitters can exploit one common relay node to improve their individual transmission rate. ...