Sciweavers

16504 search results - page 283 / 3301
» New Problems, New Solutions
Sort
View
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
15 years 6 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
217
Voted
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
ISBI
2006
IEEE
16 years 7 months ago
Continuous image representations avoid the histogram binning problem in mutual information based image registration
Mutual information (MI) based image-registration methods that use histograms are known to suffer from the so-called binning problem, caused by the absence of a principled techniqu...
Ajit Rajwade, Arunava Banerjee, Anand Rangarajan
ICNC
2005
Springer
16 years 5 days ago
Harmony Search for Generalized Orienteering Problem: Best Touring in China
In order to overcome the drawbacks of mathematical optimization techniques, soft computing algorithms have been vigorously introduced during the past decade. However, there are sti...
Zong Woo Geem, Chung-Li Tseng, Yongjin Park
LSSC
2005
Springer
16 years 4 days ago
Ant Algorithm for Grid Scheduling Problem
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
Stefka Fidanova, Mariya K. Durchova