Sciweavers

1185 search results - page 159 / 237
» The Equivalence of Sampling and Searching
Sort
View
RECOMB
2007
Springer
14 years 8 months ago
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
The study of biological networks and network motifs can yield significant new insights into systems biology. Previous methods of discovering network motifs ? network-centric subgra...
Joshua A. Grochow, Manolis Kellis
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 8 months ago
Privacy preservation of aggregates in hidden databases: why and how?
Many websites provide form-like interfaces which allow users to execute search queries on the underlying hidden databases. In this paper, we explain the importance of protecting s...
Arjun Dasgupta, Nan Zhang, Gautam Das, Surajit Cha...
SLS
2009
Springer
243views Algorithms» more  SLS 2009»
14 years 2 months ago
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
14 years 2 months ago
On the constructiveness of context-aware crossover
Crossover in Genetic Programming is mostly a destructive operator, generally producing children worse than the parents and occasionally producing those who are better. A recently ...
Hammad Majeed, Conor Ryan
SARA
2007
Springer
14 years 2 months ago
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
Ugur Kuter, Jiaqiao Hu