Sciweavers

347 search results - page 34 / 70
» The Berlekamp-Massey Algorithm revisited
Sort
View
COCOA
2008
Springer
15 years 22 days ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
SIAMSC
2008
111views more  SIAMSC 2008»
14 years 11 months ago
Revisiting the Crowding Phenomenon in Schwarz-Christoffel Mapping
We address the problem of conformally mapping the unit disk to polygons with elongations. The elongations cause the derivative of the conformal map to be exponentially large in so...
L. Banjai
INFOCOM
2005
IEEE
15 years 4 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
ICML
2007
IEEE
15 years 11 months ago
Revisiting probabilistic models for clustering with pair-wise constraints
We revisit recently proposed algorithms for probabilistic clustering with pair-wise constraints between data points. We evaluate and compare existing techniques in terms of robust...
Blaine Nelson, Ira Cohen
CEC
2005
IEEE
15 years 4 months ago
Revisiting genetic selection in the XCS learning classifier system
The XCS Learning Classifier System has traditionally used roulette wheel selection within its genetic algorithm component. Recently, tournament selection has been suggested as prov...
Faten Kharbat, Larry Bull, Mohammed Odeh