Sciweavers

14518 search results - page 298 / 2904
» Two Problems for Sophistication
Sort
View
JUCS
2000
117views more  JUCS 2000»
15 years 6 months ago
The Light Control Case Study: Problem Description
: This document contains a range of needs and requirements concerning the construction of a light control system for a floor of a university building. A description of the building...
Stefan Queins, Gerhard Zimmermann, Martin Becker, ...
ORL
2000
77views more  ORL 2000»
15 years 6 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 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...
TSMC
1998
92views more  TSMC 1998»
15 years 6 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 6 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