Sciweavers

16504 search results - page 10 / 3301
» New Problems, New Solutions
Sort
View
AUSAI
2003
Springer
15 years 5 months ago
A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
Ying Kong, Fan Wang, Andrew Lim, Songshan Guo
ISCI
2010
211views more  ISCI 2010»
14 years 10 months ago
A new heuristic approach for non-convex optimization problems
In this work a new optimization method, called the heuristic Kalman algorithm (HKA), is presented. This new algorithm is proposed as an alternative approach for solving continuous,...
Rosario Toscano, Patrick Lyonnet
SCL
2008
56views more  SCL 2008»
15 years 6 days ago
A new vertex result for robustness problems with interval matrix uncertainty
This paper1 addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a n...
Teodoro Alamo, Roberto Tempo, Daniel R. Ramí...
JNW
2007
80views more  JNW 2007»
15 years 5 days ago
A New Method of Using Sensor Network for Solving Pursuit-Evasion Problem
— Wireless sensor networks offer the potential to significantly improve the performance of pursuers in pursuit-evasion games. In this paper, we study several sensor network syst...
Peng Zhuang, Yi Shang, Hongchi Shi
ISCC
2005
IEEE
116views Communications» more  ISCC 2005»
15 years 5 months ago
Link Buffer Sizing: A New Look at the Old Problem
We revisit the question of how much buffer an IP router should allocate for its Droptail FIFO link. For a long time, setting the buffer size to the bitrate-delay product has been ...
Sergey Gorinsky, Anshul Kantawala, Jonathan S. Tur...