Sciweavers

976 search results - page 37 / 196
» The Complexity of Timetable Construction Problems
Sort
View
IJDMB
2010
128views more  IJDMB 2010»
13 years 4 months ago
Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal latt
: Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation....
Alessandro Dal Palù, Agostino Dovier, Enric...
CSR
2010
Springer
14 years 6 days ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning
IPL
2010
71views more  IPL 2010»
13 years 5 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson
MOBISYS
2006
ACM
14 years 7 months ago
ARIADNE: a dynamic indoor signal map construction and localization system
Location determination of mobile users within a building has attracted much attention lately due to its many applications in mobile networking including network intrusion detectio...
Yiming Ji, Saad Biaz, Santosh Pandey, Prathima Agr...
PAMI
2002
122views more  PAMI 2002»
13 years 7 months ago
Analytic PCA Construction for Theoretical Analysis of Lighting Variability in Images of a Lambertian Object
We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. Si...
Ravi Ramamoorthi