2340 search results - page 43 / 468 » Copying and Comparing: Problems and Solutions |
CONEXT
2009
ACM
15 years 27 days ago
2009
ACM
The behavior of routing protocols during convergence is critical as it impacts end-to-end performance. Network convergence is particularly important in BGP, the current interdomai...
101
click to vote
JCO
2010
14 years 10 months ago
2010
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
CEC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— This paper proposes an multi-objective evolutionary algorithm. The algorithm is based on OMOEA-II[2]. A new linear breeding operator with lower-dimensional crossover an...
136
click to vote
CONEXT
2009
ACM
15 years 27 days ago
2009
ACM
We consider the problem of providing ubiquitous yet affordable Internet connectivity to devices at home, at work, and on the move. In this context, we take advantage of two signif...
RSA
2006
14 years 11 months ago
2006
In this note we discuss several combinatorial problems that can be addressed by the Regularity Method for hypergraphs. Based on recent results of Nagle, Schacht and the authors, we...