Sciweavers

302 search results - page 55 / 61
» Efficient Algorithms for the Longest Path Problem
Sort
View
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
14 years 9 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu
IJRR
2008
73views more  IJRR 2008»
13 years 8 months ago
Optimization of Complex Robot Applications under Real Physical Limitations
This paper deals with minimum time trajectory optimization along a specified path subject to thermal constraints. We point out here that robots are often integrated in complex rob...
Matthieu Guilbert, Luc D. Joly, Pierre-Brice Wiebe...
IJHPCA
2006
125views more  IJHPCA 2006»
13 years 8 months ago
Complexity Results for Collective Communications on Heterogeneous Platforms
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...
Olivier Beaumont, Loris Marchal, Yves Robert
ATAL
2006
Springer
14 years 13 days ago
Distributed navigation in an unknown physical environment
We address the problem of navigating from an initial node to a goal node by a group of agents in an unknown physical environment. In such environments mobile agents must physicall...
Arnon Gilboa, Amnon Meisels, Ariel Felner
GLOBECOM
2010
IEEE
13 years 6 months ago
Routing and Spectrum Allocation in OFDM-Based Optical Networks with Elastic Bandwidth Allocation
Orthogonal Frequency Division Multiplexing (OFDM) has been recently proposed as a modulation technique for optical networks, due to its good spectral efficiency and impairment tole...
Kostas Christodoulopoulos, Ioannis Tomkos, Emmanou...