450 search results - page 35 / 90 » Satisfiability with Exponential Families |
117
click to vote
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
107
click to vote
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and...
111
click to vote
AISC
2010
Springer
15 years 4 months ago
2010
Springer
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different bounda...
AAAI
2007
15 years 2 months ago
2007
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
COCOON
2008
Springer
15 years 1 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...