Sciweavers

13987 search results - page 267 / 2798
» The Two Guards Problem
Sort
View
ORL
2000
77views more  ORL 2000»
15 years 4 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
15 years 4 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...
TSMC
1998
92views more  TSMC 1998»
15 years 4 months ago
Solving the orientation-duality problem for a circular feature in motion
Circular features have been commonly used in numerous computer vision application areas for 3-D pose estimation. However, the estimation of such a feature’s pose from 2-D image ...
D. He, Beno Benhabib
TPDS
2002
126views more  TPDS 2002»
15 years 4 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
FUIN
2010
109views more  FUIN 2010»
15 years 2 months ago
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Given a set of taxa S and a complete set of quartet topologies Q over S, the problem of determining a phylogeny that satisfies the maximum number of topologies is called the Maxi...
António Morgado, João Marques-Silva