Sciweavers

14739 search results - page 369 / 2948
» An optimization problem on the sphere
Sort
View
ICAC
2006
IEEE
16 years 26 days ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
16 years 25 days ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
HICSS
2005
IEEE
160views Biometrics» more  HICSS 2005»
16 years 13 days ago
Problem Based Learning and the Business School Environment
This paper attempts to create a research cycle for Problem Based Learning and in so doing help substantiate the use of PBL in business school environments. The paper starts with a...
Wm. Benjamin Martz Jr., Morgan M. Shepherd
KES
2005
Springer
16 years 9 days ago
A Robust Approach for Improving Computational Efficiency of Order-Picking Problems
The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This pa...
Yu-Min Chiang, Shih-Hsin Chen, Kuo-Chang Wu
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
16 years 8 days ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom