Sciweavers

1027 search results - page 199 / 206
» A New Content-Based Model for Social Network Analysis
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 8 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
WADS
2007
Springer
89views Algorithms» more  WADS 2007»
14 years 1 months ago
Dynamic TCP Acknowledgment with Sliding Window
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
Hisashi Koga
CIBCB
2007
IEEE
13 years 9 months ago
Optimization of Bacterial Strains with Variable-Sized Evolutionary Algorithms
—In metabolic engineering it is difficult to identify which set of genetic manipulations will result in a microbial strain that achieves a desired production goal, due to the co...
Miguel Rocha, José P. Pinto, Isabel Rocha, ...
TCBB
2008
103views more  TCBB 2008»
13 years 7 months ago
DNA Motif Representation with Nucleotide Dependency
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
Francis Y. L. Chin, Henry C. M. Leung
AI
2000
Springer
13 years 7 months ago
Stochastic dynamic programming with factored representations
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...
Craig Boutilier, Richard Dearden, Moisés Go...