Sciweavers

117 search results - page 5 / 24
» Hybrid constructive heuristics for the critical node problem
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 2 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
GECCO
1999
Springer
116views Optimization» more  GECCO 1999»
15 years 2 months ago
Dynamic Degree Constrained Network Design: A Genetic Algorithm Approach
The design and development of network infrastructure to support mission-critical operations has become a critical and complicated issue. In this study we explore the use of geneti...
Chao-Hsien Chu, G. Premkumar, Carey Chou, Jianzhon...
TCOS
2008
14 years 10 months ago
On Reduct Construction Algorithms
This paper critically analyzes reduct construction methods evels. At a high level, one can abstract commonalities from the existing algorithms, and classify them into three basic g...
Yiyu Yao, Yan Zhao, Jue Wang
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
14 years 10 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
INFOCOM
2007
IEEE
15 years 4 months ago
The Power Balancing Problem in Energy Constrained Multi-Hop Wireless Networks
— Power efficient operation is very critical in energy constrained multi-hop wireless networks. One important technique is to intelligently assign transmission powers to nodes w...
Randeep Bhatia, Abhishek Kashyap, Erran L. Li