Sciweavers

849 search results - page 93 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
DM
2008
50views more  DM 2008»
13 years 8 months ago
Searching monotone multi-dimensional arrays
A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional array with ...
Yongxi Cheng, Xiaoming Sun, Yiqun Lisa Yin
COMCOM
2006
75views more  COMCOM 2006»
13 years 8 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
JSA
2006
88views more  JSA 2006»
13 years 7 months ago
Scheduling tasks sharing files on heterogeneous master-slave platforms
This paper is devoted to scheduling a large collection of independent tasks onto heterogeneous clusters. The tasks depend upon (input) files which initially reside on a master pro...
Arnaud Giersch, Yves Robert, Frédéri...
TSP
2008
94views more  TSP 2008»
13 years 7 months ago
Optimal Particle Filters for Tracking a Time-Varying Harmonic or Chirp Signal
We consider the problem of tracking the time-varying (TV) parameters of a harmonic or chirp signal using particle filtering (PF) tools. Similar to previous PF approaches to TV spec...
E. E. Tsakonas, Nicholas D. Sidiropoulos, Ananthra...
AROBOTS
2002
91views more  AROBOTS 2002»
13 years 7 months ago
Fast, On-Line Learning of Globally Consistent Maps
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...
Tom Duckett, Stephen Marsland, Jonathan Shapiro