Analytic and algorithmic solution of random satisfiability problems.
about
Scaling and universality in continuous length combinatorial optimizationDivide and concur: A general approach to constraint satisfactionA scalable algorithm to explore the Gibbs energy landscape of genome-scale metabolic networksPerturbation biology: inferring signaling networks in cellular systemsIdentifying all moiety conservation laws in genome-scale metabolic networksAccurate, fully-automated NMR spectral profiling for metabolomicsIdentification of direct residue contacts in protein-protein interaction by message passingClustering by soft-constraint affinity propagation: applications to gene-expression data.Estimating the size of the solution space of metabolic networks.Landscape encodings enhance optimizationSpin glasses and fragile glasses: statics, dynamics, and complexitySearching with iterated maps.Physics and complexity.Collaboration in social networksEfficient supervised learning in networks with binary synapses.The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.Gibbs states and the set of solutions of random constraint satisfaction problems.An event-based architecture for solving constraint satisfaction problems.Inverse problem for multi-body interaction of nonlinear waves.Circumspect descent prevails in solving random constraint satisfaction problems.From the physics of interacting polymers to optimizing routes on the London Underground.Zero-temperature quantum annealing bottlenecks in the spin-glass phase.The backtracking survey propagation algorithm for solving random K-SAT problems.A comparative runtime analysis of heuristic algorithms for satisfiability problems.Unreasonable effectiveness of learning neural networks: From accessible states and robust ensembles to basic algorithmic schemes.Combinatorial optimization using dynamical phase transitions in driven-dissipative systems.Inference of the sparse kinetic Ising model using the decimation method.Dynamic message-passing equations for models with unidirectional dynamics.Bayesian feature selection for high-dimensional linear regression via the Ising approximation with applications to genomics.Cavity approach for modeling and fitting polymer stretching.Harnessing the Bethe free energy.Join-Graph Propagation Algorithms.Inferring the origin of an epidemic with a dynamic message-passing algorithm.Quantum vertex model for reversible classical computing.An asymmetric underlying rule in the assignment of codons: possible clue to a quick early evolution of the genetic code via successive binary choices.Learning factorizations in estimation of distribution algorithms using affinity propagation.Return probabilities and hitting times of random walks on sparse Erdös-Rényi graphs.Witness of unsatisfiability for a random 3-satisfiability formula.Statistical mechanics of lossy compression for nonmonotonic multilayer perceptrons.Statistical mechanics of maximal independent sets.
P2860
Q24673245-18B29144-DF32-41FA-AB1D-9BBE135F718BQ27350472-27194A16-5083-4770-AB46-765DC52359A9Q28480577-614E16ED-CADC-43AC-B520-383E0B541062Q28537769-3F28A701-F4E7-4D2A-AAF2-BC052562C30CQ28540255-6001A81B-8C99-42CA-9BED-B5F1C0A1F7B2Q28547537-70663034-D257-4B92-ABA0-065C64DDB9A8Q29395268-E7C41DFC-9894-4D3D-800D-8D9DBDA9C117Q31131024-088CDB1E-60CA-4994-9A4E-2920B2ADFE99Q33335945-05FF0212-3C05-469F-8AFB-B109634CD180Q34230347-CE7D20FC-B64B-4351-8668-9635CEE44C96Q34600512-2B4DECE9-5095-437F-877E-667EEAD2CD96Q35578660-77923348-FA08-4030-8E36-EEEC3E5F978BQ35687987-F4401613-919E-42E4-9843-12EA7A2667FFQ35849649-A6FFE12B-CCB5-4804-B231-0E1456A2C7D8Q35864950-A14C524F-5A6E-4084-B84F-9AAFDF168DC3Q35879627-B364BE93-486E-49D2-B095-FE4F85C89815Q35973227-5B30392A-C188-4830-B0C8-2DE0F57FB3B8Q36392536-CB6D6CA7-7120-4F65-80DB-1F69841429A2Q36405788-15589974-1AA1-4444-9297-19EBE06976FBQ36926906-37F03BFD-8ED6-4C00-8B19-D5B5C45FF1F2Q37117743-08485B7B-2B00-4718-9844-F1C3B4551B9AQ37166171-BB6A15A5-83B9-4022-862F-998637245BEEQ37338877-B9D36645-864B-4EA0-9802-7387E390944EQ37415389-A2C8E72C-652C-4660-B8E8-8C3FECB9D06CQ37473851-6EE280B7-937E-49F0-86D7-F98E57F4307CQ40452470-B98383BC-F730-424A-B5D0-2E26AED60E37Q40844905-9BE6C693-7CC0-4AF4-8BEF-E1B9325A262CQ41484852-178E405F-CA54-44C9-B3B9-FB01F888B2A8Q41529112-52010EEC-9C13-4DA0-BC0A-2994B27ED2EDQ41706578-68275D48-EEB1-4225-831E-5086918C291CQ41886426-13FEE922-8AC6-4A71-9E37-C48E444AB366Q42175492-4D6E0D7E-D7DE-4FA3-B6D4-57637F81B080Q42200036-52A57528-4C15-4245-9A20-B6CBD906350DQ42256700-381E29F5-4AD9-485C-90E7-25A7555B5198Q42983940-D6D52FCE-0B4D-430B-86EC-A81F7710F02DQ43495242-D8C53142-2EF4-4607-A406-DC94AEA20A77Q43568654-DB4BD332-0324-402D-82A6-BE231CCB3909Q44634140-638A4591-B517-40C7-8A95-0E196D0CB35DQ44715762-A014F4C1-1B7B-4274-A071-515894A18C8EQ45339351-CC75F476-B190-4C58-B2F8-9E424470559A
P2860
Analytic and algorithmic solution of random satisfiability problems.
description
2002 nî lūn-bûn
@nan
2002年の論文
@ja
2002年学术文章
@wuu
2002年学术文章
@zh
2002年学术文章
@zh-cn
2002年学术文章
@zh-hans
2002年学术文章
@zh-my
2002年学术文章
@zh-sg
2002年學術文章
@yue
2002年學術文章
@zh-hant
name
Analytic and algorithmic solution of random satisfiability problems.
@en
Analytic and algorithmic solution of random satisfiability problems.
@nl
type
label
Analytic and algorithmic solution of random satisfiability problems.
@en
Analytic and algorithmic solution of random satisfiability problems.
@nl
prefLabel
Analytic and algorithmic solution of random satisfiability problems.
@en
Analytic and algorithmic solution of random satisfiability problems.
@nl
P356
P1433
P1476
Analytic and algorithmic solution of random satisfiability problems.
@en
P2093
P304
P356
10.1126/SCIENCE.1073287
P407
P577
2002-06-27T00:00:00Z