Sciweavers

1522 search results - page 60 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
EUROPAR
2010
Springer
13 years 8 months ago
Analysis of Multi-Organization Scheduling Algorithms
Abstract. In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Probl...
Johanne Cohen, Daniel Cordeiro, Denis Trystram, Fr...
CVPR
2012
IEEE
12 years 1 months ago
Branch-and-price global optimization for multi-view multi-object tracking
We present a new algorithm to jointly track multiple objects in multi-view images. While this has been typically addressed separately in the past, we tackle the problem as a single...
Laura Leal-Taixe, Gerard Pons-Moll, Bodo Rosenhahn
SI3D
2012
ACM
12 years 3 months ago
Interactive rendering of acquired materials on dynamic geometry using bandwidth prediction
Shading complex materials such as acquired reflectances in multilight environments is computationally expensive. Estimating the shading integral requires multiple samples of the ...
Mahdi M. Bagher, Cyril Soler, Kartic Subr, Laurent...
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
13 years 8 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 2 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin