Sciweavers

3415 search results - page 583 / 683
» Lower Bounds for Kernelizations
Sort
View
ANOR
2005
120views more  ANOR 2005»
13 years 10 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
IM
2007
13 years 10 months ago
Ranking Websites: A Probabilistic View
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
Ying Bao, Guang Feng, Tie-Yan Liu, Zhiming Ma, Yin...
TCOM
2008
151views more  TCOM 2008»
13 years 10 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee
INTEGRATION
2007
69views more  INTEGRATION 2007»
13 years 10 months ago
A fast algorithm for rectilinear block packing based on selected sequence-pair
In this paper, we present a method of rectilinear block packing using selected sequence-pair (SSP), a rectangle packing representation. We also propose a fast algorithm to obtain ...
Kunihiro Fujiyoshi, Chikaaki Kodama, Akira Ikeda
IVC
2007
114views more  IVC 2007»
13 years 10 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...