986 search results - page 111 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
134
click to vote
SPAA
1995
ACM
15 years 7 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
132
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
124
click to vote
AIPS
2009
15 years 5 months ago
2009
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
137
click to vote
ORDER
2007
15 years 3 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
159
click to vote
TON
1998
15 years 3 months ago
1998
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...