Sciweavers

2313 search results - page 233 / 463
» On Heuristic Time Hierarchies
Sort
View
TPDS
2008
92views more  TPDS 2008»
15 years 6 months ago
Topology Design of Network-Coding-Based Multicast Networks
It is anticipated that a large amount of multicast traffic needs to be supported in future communication networks. The network coding technique proposed recently is promising for e...
Kaikai Chi, Xiaohong Jiang, Susumu Horiguchi, Miny...
AIR
2004
130views more  AIR 2004»
15 years 6 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
TKDE
1998
100views more  TKDE 1998»
15 years 6 months ago
Scalability Analysis of Declustering Methods for Multidimensional Range Queries
E cient storage and retrieval of multi-attribute datasets have become one of the essential requirements for many data-intensive applications. The Cartesian product le has been kno...
Bongki Moon, Joel H. Saltz
MST
2010
117views more  MST 2010»
15 years 5 months ago
Class Constrained Bin Covering
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
CEC
2010
IEEE
15 years 4 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...