Sciweavers

3758 search results - page 279 / 752
» A Complete Subsumption Algorithm
Sort
View
INFORMATICALT
2006
117views more  INFORMATICALT 2006»
15 years 6 months ago
Job Sequencing with Exponential Functions of Processing Times
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
Adam Janiak, Mikhail Y. Kovalyov
CSDA
2007
100views more  CSDA 2007»
15 years 6 months ago
Convergence of random k-nearest-neighbour imputation
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
Fredrik A. Dahl
PR
2006
131views more  PR 2006»
15 years 6 months ago
A face recognition system based on automatically determined facial fiducial points
In this paper a completely automatic face recognition system is presented. The method works on color images: after having localized the face and the facial features, it determines...
Stefano Arca, Paola Campadelli, Raffaella Lanzarot...
CACM
2002
96views more  CACM 2002»
15 years 6 months ago
Self-reconfiguring robots
: We discuss the applications of modular self-reconfigurable robots to navigation. We show that greedy algorithms are complete for motion planning over a class of modular reconfigu...
Daniela Rus, Zack J. Butler, Keith Kotay, Marsette...
JCB
2000
129views more  JCB 2000»
15 years 6 months ago
Prediction of RNA Base Pairing Probabilities on Massively Parallel Computers
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
Martin Fekete, Ivo L. Hofacker, Peter F. Stadler