Sciweavers

450 search results - page 26 / 90
» Satisfiability with Exponential Families
Sort
View
FOCS
1990
IEEE
15 years 8 months ago
Complexity of Unification in Free Groups and Free Semi-groups
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
Antoni Koscielski, Leszek Pacholski
SYNTHESE
2008
114views more  SYNTHESE 2008»
15 years 4 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
CEC
2011
IEEE
14 years 4 months ago
Stochastic Natural Gradient Descent by estimation of empirical covariances
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
Luigi Malagò, Matteo Matteucci, Giovanni Pi...
JCT
2007
96views more  JCT 2007»
15 years 4 months ago
Co-degree density of hypergraphs
For an r-graph H, let C(H) = minS d(S), where the minimum is taken over all (r − 1)-sets of vertices of H, and d(S) is the number of vertices v such that S ∪ {v} is an edge of...
Dhruv Mubayi, Yi Zhao
BMCBI
2005
97views more  BMCBI 2005»
15 years 4 months ago
Clustering the annotation space of proteins
Background: Current protein clustering methods rely on either sequence or functional similarities between proteins, thereby limiting inferences to one of these areas. Results: Her...
Victor Kunin, Christos A. Ouzounis