Sciweavers

1921 search results - page 257 / 385
» The Student-Project Allocation Problem
Sort
View
SWAT
1992
Springer
111views Algorithms» more  SWAT 1992»
15 years 10 months ago
Retrieval of scattered information by EREW, CREW and CRCW PRAMs
The k-compaction problem arises when k out of n cells in an array are non-empty and the contents of these cells must be moved to the first k locations in the array. Parallel algori...
Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, ...
ATMOS
2007
161views Optimization» more  ATMOS 2007»
15 years 8 months ago
Periodic Railway Timetabling with Event Flexibility
This paper addresses the problem of generating conflict-free periodic train timetables for large railway networks. We follow a two level approach, where a simplified track topolo...
Gabrio Curzio Caimi, Martin Fuchsberger, Marco Lau...
DKE
1999
118views more  DKE 1999»
15 years 6 months ago
Designing Data Warehouses
A Data Warehouse DW is a database that collects and stores data from multiple remote and heterogeneous information sources. When a query is posed, it is evaluated locally, without...
Dimitri Theodoratos, Timos K. Sellis
TON
2002
123views more  TON 2002»
15 years 6 months ago
Utility-based rate control in the Internet for elastic traffic
In a communication network, a good rate allocation algorithm should reflect the utilities of the users while being fair. We investigate this fundamental problem of achieving the sy...
Richard J. La, Venkat Anantharam
TMC
2010
100views more  TMC 2010»
15 years 4 months ago
Optimal Relay Station Placement in Broadband Wireless Access Networks
—To satisfy the stringent requirement of capacity enhancement in wireless networks, cooperative relaying is envisioned as one of the most effective solutions. In this paper, we s...
Bin Lin, Pin-Han Ho, Liang-Liang Xie, Xuemin (Sher...