Sciweavers

7978 search results - page 273 / 1596
» Combining shared-coin algorithms
Sort
View
CSDA
2006
82views more  CSDA 2006»
15 years 4 months ago
Nearest neighbours in least-squares data imputation algorithms with different missing patterns
Methods for imputation of missing data in the so-called least-squares approximation approach, a non-parametric computationally efficient multidimensional technique, are experiment...
Ito Wasito, Boris Mirkin
161
Voted
JNW
2006
88views more  JNW 2006»
15 years 4 months ago
A Genetic Algorithms Based Approach for Group Multicast Routing
Whereas multicast transmission in one-to-many communications allows the operator to drastically save network resources, it also makes the routing of the traffic flows more complex ...
Luca Sanna Randaccio, Luigi Atzori
IPL
2007
99views more  IPL 2007»
15 years 4 months ago
Approximation algorithms for minimizing segments in radiation therapy
Intensity modulated radiation therapy (IMRT) is one of the most effective modalities for modern cancer treatment. The key to successful IMRT treatment hinges on the delivery of a...
Shuang Luan, Jared Saia, Maxwell Young
JAIR
2007
141views more  JAIR 2007»
15 years 4 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
151
Voted
TSMC
2008
99views more  TSMC 2008»
15 years 4 months ago
A Context-Dependent Algorithm for Merging Uncertain Information in Possibility Theory
The need to merge multiple sources of uncertain information is an important issue in many application areas, especially when there is potential for contradictions between sources. ...
Anthony Hunter, Weiru Liu