Sciweavers

5624 search results - page 153 / 1125
» On Conditional Covering Problem
Sort
View
TCS
2008
15 years 6 months ago
Self-deployment of mobile sensors on a ring
Mobile sensors can self-deploy in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which they cover uniformly the enviro...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
ASPDAC
2007
ACM
124views Hardware» more  ASPDAC 2007»
15 years 10 months ago
BddCut: Towards Scalable Symbolic Cut Enumeration
While the covering algorithm has been perfected recently by the iterative approaches, such as DAOmap and IMap, its application has been limited to technology mapping. The main fact...
Andrew C. Ling, Jianwen Zhu, Stephen Dean Brown
IJSNET
2006
110views more  IJSNET 2006»
15 years 6 months ago
Improving network lifetime using sensors with adjustable sensing ranges
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...
Mihaela Cardei, Jie Wu, Mingming Lu
AMC
2005
136views more  AMC 2005»
15 years 6 months ago
Solving a dynamic cell formation problem using metaheuristics
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
Reza Tavakkoli-Moghaddam, M. B. Aryanezhad, Nima S...
MOC
2000
85views more  MOC 2000»
15 years 6 months ago
Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior point algorithm f...
Liqun Qi, Defeng Sun