Sciweavers

2370 search results - page 414 / 474
» A Structured Set of Higher-Order Problems
Sort
View
WWW
2010
ACM
14 years 3 months ago
Inferring relevant social networks from interpersonal communication
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...
Munmun De Choudhury, Winter A. Mason, Jake M. Hofm...
IJCNN
2008
IEEE
14 years 3 months ago
A comparison of fuzzy ARTMAP and Gaussian ARTMAP neural networks for incremental learning
Abstract— Automatic pattern classifiers that allow for incremental learning can adapt internal class models efficiently in response to new information, without having to retrai...
Eric Granger, Jean-François Connolly, Rober...
INFOCOM
2006
IEEE
14 years 3 months ago
Designing Low Cost Networks with Short Routes and Low Congestion
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
Van Nguyen, Charles U. Martel
GECCO
2004
Springer
140views Optimization» more  GECCO 2004»
14 years 2 months ago
Keeping the Diversity with Small Populations Using Logic-Based Genetic Programming
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...
Ken Taniguchi, Takao Terano
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 1 months ago
Connectivity oracles for failure prone graphs
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...
Ran Duan, Seth Pettie