Sciweavers

2638 search results - page 304 / 528
» Random Geometric Complexes
Sort
View
SAT
2010
Springer
165views Hardware» more  SAT 2010»
15 years 5 months ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
15 years 4 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
16 years 1 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
AGENTS
2001
Springer
15 years 11 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
JCB
2006
114views more  JCB 2006»
15 years 6 months ago
A General Modeling Strategy for Gene Regulatory Networks with Stochastic Dynamics
A stochastic genetic toggle switch model that consists of two identical, mutually repressive genes is built using the Gillespie algorithm with time delays as an example of a simpl...
Andre Ribeiro, Rui Zhu, Stuart A. Kauffman