2373 search results - page 51 / 475 » Complexities for generalized models of self-assembly |
137
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
133
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
138
click to vote
SIAMSC
2008
15 years 2 months ago
2008
In the mathematical modeling of real-life applications, systems of equations with complex coefficients often arise. While many techniques of numerical linear algebra, e.g., Krylovs...
159
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
147
click to vote
AAAI
2010
15 years 5 months ago
2010
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...