Sciweavers

2079 search results - page 43 / 416
» Universality of random graphs
Sort
View
AUSAI
2005
Springer
15 years 7 months ago
Neighborhood Re-structuring in Particle Swarm Optimization
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
Arvind S. Mohais, Rui Mendes, Christopher Ward, Ch...
TREC
2004
15 years 3 months ago
Columbia University in the Novelty Track at TREC 2004
Our system for the Novelty Track at TREC 2004 looks beyond sentence boundaries as well as within sentences to identify novel, nonduplicative passages. It tries to identify text sp...
Barry Schiffman, Kathleen McKeown
TREC
2007
15 years 3 months ago
University of Twente at the TREC 2007 Enterprise Track: Modeling Relevance Propagation for the Expert Search Task
This paper describes several approaches which we used for the expert search task of the TREC 2007 Enterprise track. We studied several methods of relevance propagation from docume...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
TREC
2007
15 years 3 months ago
University of Glasgow at TREC 2007: Experiments in Blog and Enterprise Tracks with Terrier
In TREC 2007, we participate in four tasks of the Blog and Enterprise tracks. We continue experiments using Terrier1 [14], our modular and scalable Information Retrieval (IR) plat...
David Hannah, Craig Macdonald, Jie Peng, Ben He, I...
CPC
2007
95views more  CPC 2007»
15 years 1 months ago
Colouring Random Regular Graphs
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
Lingsheng Shi, Nicholas C. Wormald