Sciweavers

4894 search results - page 579 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
ADHOC
2005
122views more  ADHOC 2005»
15 years 4 months ago
Maintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clusterin...
Yuanzhu Peter Chen, Arthur L. Liestman
135
Voted
IJRR
2007
60views more  IJRR 2007»
15 years 4 months ago
Randomized Algorithms for Minimum Distance Localization
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
Malvika Rao, Gregory Dudek, Sue Whitesides
104
Voted
TNN
2008
82views more  TNN 2008»
15 years 4 months ago
Deterministic Learning for Maximum-Likelihood Estimation Through Neural Networks
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
Cristiano Cervellera, Danilo Macciò, Marco ...
TR
2008
117views more  TR 2008»
15 years 4 months ago
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
Alain Billionnet
TSP
2008
102views more  TSP 2008»
15 years 4 months ago
A Minimax Chebyshev Estimator for Bounded Error Estimation
We develop a nonlinear minimax estimator for the classical linear regression model assuming that the true parameter vector lies in an intersection of ellipsoids. We seek an estimat...
Yonina C. Eldar, Amir Beck, Marc Teboulle