1568 search results - page 49 / 314 » The problem of examination questions in algorithmics |
AI
1998
Springer
14 years 9 months ago
1998
Springer
This paper introduces a niching technique called GAS (S stands for species) which dynamically creates a subpopulation structure (taxonomic chart) using a radius function instead of...
CEC
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- We present a case study demonstrating that using the REVAC parameter tuning method we can greatly improve the `world champion' EA (the winner of the CEC2005 competi...
TACAS
2010
Springer
15 years 5 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
ALGORITHMICA
2006
14 years 10 months ago
2006
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
NIPS
2008
14 years 11 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...