Sciweavers

1964 search results - page 257 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
GLOBECOM
2008
IEEE
14 years 2 months ago
Impact of Constraints on the Complexity of Dynamic Spectrum Assignment
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
Chetan Nanjunda Mathur, Mohamed A. Haleem, Rajarat...
SIGMOD
2005
ACM
145views Database» more  SIGMOD 2005»
14 years 8 months ago
Stratified Computation of Skylines with Partially-Ordered Domains
In this paper, we study the evaluation of skyline queries with partially-ordered attributes. Because such attributes lack a total ordering, traditional index-based evaluation algo...
Chee Yong Chan, Pin-Kwang Eng, Kian-Lee Tan
LFP
1990
73views more  LFP 1990»
13 years 9 months ago
Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs
Many parallel algorithms are naturally expressed at a ne level of granularity, often ner than a MIMD parallel system can exploit eciently. Most builders of parallel systems have...
Eric Mohr, David A. Kranz, Robert H. Halstead Jr.
SIMULATION
1998
177views more  SIMULATION 1998»
13 years 8 months ago
Simulation and Planning of an Intermodal Container Terminal
A decision support system for the management of an intermodal container terminal is presented. Among the problems to be solved, there are the spatial allocation of containers on t...
Luca Maria Gambardella, Andrea Emilio Rizzoli, Mar...
ATAL
2010
Springer
13 years 9 months ago
Point-based policy generation for decentralized POMDPs
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen