Sciweavers

5210 search results - page 365 / 1042
» Exact geometric computation
Sort
View
CIE
2009
Springer
16 years 1 months ago
Members of Random Closed Sets
Abstract. The members of Martin-L¨of random closed sets under a distribution studied by Barmpalias et al. are exactly the infinite paths through Martin-L¨of random Galton-Watson...
David Diamondstone, Bjørn Kjos-Hanssen
FCT
2009
Springer
16 years 1 months ago
Martingales on Trees and the Empire Chromatic Number of Random Trees
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
Colin Cooper, Andrew R. A. McGrae, Michele Zito
IPPS
2007
IEEE
16 years 1 months ago
A hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem
This work presents a new hybrid Evolutionary Algorithm for the Dynamic Resource Constrained Task Scheduling Problem (DRCTSP). The most important differences between the new EA and...
André Renato Villela da Silva, Luiz Satoru ...
WG
2007
Springer
16 years 27 days ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
CVPR
2010
IEEE
16 years 13 days ago
Polynomial Shape from Shading
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects....
Ady Ecker, Allan Jepson