Sciweavers

2983 search results - page 90 / 597
» The group marriage problem
Sort
View
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
15 years 2 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
16 years 1 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
130
Voted
AINA
2005
IEEE
15 years 6 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko
EUSFLAT
2009
194views Fuzzy Logic» more  EUSFLAT 2009»
14 years 10 months ago
A Fuzzy Particle Swarm Optimization Algorithm for a Cell Formation Problem
Group technology (GT) is a useful way to increase productivity with high quality in cellular manufacturing systems (CMSs), in which cell formation (CF) is a key step in the GT phil...
Esmaeil Mehdizadeh, Reza Tavakkoli-Moghaddam
ESWA
2010
105views more  ESWA 2010»
14 years 10 months ago
A numerical comparison between simulated annealing and evolutionary approaches to the cell formation problem
The Cell Formation Problem is a crucial component of a cell production design in a manufacturing system. This problem consists of a set of product parts to be manufactured in a gr...
Andres Pailla, Athila R. Trindade, Victor Parada, ...