Sciweavers

1088 search results - page 145 / 218
» Independence of Negative Constraints
Sort
View
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
14 years 11 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
87
Voted
AAAI
1996
14 years 11 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
ATAL
2010
Springer
14 years 11 months ago
Coalition structure generation in multi-agent systems with mixed externalities
Coalition structure generation (CSG) for multi-agent systems is a well-studied problem. A vast majority of the previous work and the state-of-the-art approaches to CSG assume a ch...
Bikramjit Banerjee, Landon Kraemer
72
Voted
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
14 years 10 months ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
BMCBI
2008
128views more  BMCBI 2008»
14 years 10 months ago
Pairwise covariance adds little to secondary structure prediction but improves the prediction of non-canonical local structure
Background: Amino acid sequence probability distributions, or profiles, have been used successfully to predict secondary structure and local structure in proteins. Profile models ...
Christopher Bystroff, Bobbie-Jo M. Webb-Robertson