Sciweavers

387 search results - page 76 / 78
» Many Random Walks Are Faster Than One
Sort
View
EAAI
2007
154views more  EAAI 2007»
13 years 9 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deï¬...
Ahlem Ben Hassine, Tu Bao Ho
SAC
2008
ACM
13 years 8 months ago
Dynamic populations in genetic algorithms
Biological populations are dynamic in both space and time, that is, the population size of a species fluctuates across their habitats over time. There are rarely any static or fix...
Zhanshan (Sam) Ma, Axel W. Krings
RECOMB
2004
Springer
14 years 9 months ago
The Statistical Significance of Max-Gap Clusters
Identifying gene clusters, genomic regions that share local similarities in gene organization, is a prerequisite for many different types of genomic analyses, including operon pred...
Rose Hoberman, David Sankoff, Dannie Durand
ICALP
2009
Springer
14 years 9 months ago
External Sampling
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Roni...
CSE
2009
IEEE
14 years 3 months ago
Inferring Unobservable Inter-community Links in Large Social Networks
Abstract—Social networks can be used to model social interactions between individuals. In many circumstances, not all interactions between individuals are observed. In such cases...
Heath Hohwald, Manuel Cebrián, Arturo Canal...