600 search results - page 66 / 120 » Problems and results in extremal combinatorics - II |
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
TRIDENTCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
Several difficulties arise when testing network security algorithms. First, using network data captured at a router does not guarantee that any instances of the security event of...
IJCNN
2007
IEEE
14 years 3 months ago
2007
IEEE
— Although AdaBoost has achieved great success, it still suffers from following problems: (1) the training process could be unmanageable when the number of features is extremely ...
NCA
2007
IEEE
14 years 3 months ago
2007
IEEE
The Internet is an extremely complex system, and it is essential that we be able to make accurate measurements in order to understand its underlying behavior or to detect improper...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
Surrogate-Assisted Memetic Algorithm(SAMA) is a hybrid evolutionary algorithm, particularly a memetic algorithm that employs surrogate models in the optimization search. Since mos...