Sciweavers

3656 search results - page 366 / 732
» Compact Location Problems
Sort
View
AROBOTS
2011
15 years 1 months ago
Large scale graph-based SLAM using aerial images as prior information
— To effectively navigate in their environments and accurately reach their target locations, mobile robots require a globally consistent map of the environment. The problem of le...
Rainer Kümmerle, Bastian Steder, Christian Do...
TSMC
2011
324views more  TSMC 2011»
15 years 1 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
TACAS
2012
Springer
263views Algorithms» more  TACAS 2012»
14 years 2 months ago
Reachability under Contextual Locking
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan
INFOCOM
2008
IEEE
16 years 1 months ago
Robust Planarization of Unlocalized Wireless Sensor Networks
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
Fenghui Zhang, Anxiao Jiang, Jianer Chen
SSD
2007
Springer
243views Database» more  SSD 2007»
16 years 25 days ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...