2370 search results - page 414 / 474 » A Structured Set of Higher-Order Problems |
179
click to vote
WWW
2010
ACM
16 years 29 days ago
2010
ACM
Researchers increasingly use electronic communication data to construct and study large social networks, effectively inferring unobserved ties (e.g. i is connected to j) from obs...
157
click to vote
IJCNN
2008
IEEE
16 years 12 days ago
2008
IEEE
Abstract— Automatic pattern classifiers that allow for incremental learning can adapt internal class models efficiently in response to new information, without having to retrai...
164
click to vote
INFOCOM
2006
IEEE
16 years 23 hour ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
155
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...
143
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...