Sciweavers

1717 search results - page 173 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
COCO
2007
Springer
96views Algorithms» more  COCO 2007»
16 years 19 days ago
Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
Venkatesan Guruswami, Christopher Umans, Salil P. ...
AICT
2006
IEEE
16 years 15 days ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...
COCOON
2005
Springer
15 years 12 months ago
Exploring Simple Grid Polygons
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
KDD
2005
ACM
119views Data Mining» more  KDD 2005»
15 years 12 months ago
LIPED: HMM-based life profiles for adaptive event detection
In this paper, the proposed LIPED (LIfe Profile based Event Detection) employs the concept of life profiles to predict the activeness of event for effective event detection. A gro...
Chien Chin Chen, Meng Chang Chen, Ming-Syan Chen
PEWASUN
2004
ACM
15 years 12 months ago
A performance evaluation framework for IEEE 802.11 ad-hoc networks
Interferences in an ad-hoc network can be defined as a set of constraints that specify which groups of nodes cannot transmit simultaneously, and they have significant implications...
Ping Chung Ng, Soung Chang Liew, Li Bin Jiang