Sciweavers

1968 search results - page 212 / 394
» The Complexity of Valued Constraint Models
Sort
View
HICSS
2005
IEEE
131views Biometrics» more  HICSS 2005»
15 years 7 months ago
Train Traffic Deviation Handling Using Tabu Search and Simulated Annealing
This paper addresses the problem of solving conflicts in railway traffic that arise due to disturbances. It is formulated as a problem of re-scheduling meets and overtakes of trai...
Johanna Törnquist, Jan A. Persson
ER
2004
Springer
103views Database» more  ER 2004»
15 years 7 months ago
Querying Heterogeneous Spatial Databases: Combining an Ontology with Similarity Functions
This paper uses a knowledge-based approach to querying heterogeneous spatial databases based on an ontology and conceptual and attribute similarities. The ontology, which may be in...
Mariella Gutiérrez, M. Andrea Rodríg...
ICRA
2000
IEEE
150views Robotics» more  ICRA 2000»
15 years 6 months ago
Path Planning in Image Space for Robust Visual Servoing
Vision feedback control loop techniques are efficient for a great class of applications but they come up against difficulties when the initial and desired positions of the camer...
Youcef Mezouar, François Chaumette
NIPS
2001
15 years 3 months ago
Speech Recognition with Missing Data using Recurrent Neural Nets
In the `missing data' approach to improving the robustness of automatic speech recognition to added noise, an initial process identifies spectraltemporal regions which are do...
S. Parveen, P. Green
DISOPT
2008
85views more  DISOPT 2008»
15 years 1 months ago
How tight is the corner relaxation?
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
Matteo Fischetti, Michele Monaci