Sciweavers

4451 search results - page 255 / 891
» On Random Ordering Constraints
Sort
View
CSCLP
2005
Springer
16 years 2 days ago
A CSP Search Algorithm with Reduced Branching Factor
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
Igor Razgon, Amnon Meisels
ICRA
2003
IEEE
116views Robotics» more  ICRA 2003»
15 years 12 months ago
Linear time vehicle relocation in SLAM
Abstract— In this paper we propose an algorithm to determine the location of a vehicle in an environment represented by a stochastic map, given a set of environment measurements ...
José Neira, Juan D. Tardós, Jos&eacu...
VR
2002
IEEE
100views Virtual Reality» more  VR 2002»
15 years 11 months ago
Efficient Manipulation of Object Groups in Virtual Environments
In this paper, we describe simple techniques for object group manipulation, an important operation in user interaction with a Virtual Environment. All presented manipulation techn...
Wolfgang Stürzlinger, Graham Smith
PATAT
2000
Springer
124views Education» more  PATAT 2000»
15 years 10 months ago
Tabu Search Techniques for Examination Timetabling
Abstract The Examination Timetabling problem regards the scheduling for the exams of a set of university courses, avoiding the overlapping of exams having students in common, fairl...
Luca Di Gaspero, Andrea Schaerf
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 6 months ago
A Semidefinite Relaxation for Air Traffic Flow Scheduling
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...
Alexandre d'Aspremont, Laurent El Ghaoui