2150 search results - page 11 / 430 » On a restricted cross-intersection problem |
COMBINATORICS
2007
14 years 9 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
AMC
2005
14 years 9 months ago
2005
In most public companies in China, there are two thirds of shares that cannot be traded freely in the secondary market. These illiquid shares, however, may be allowed to circulate...
70
Voted
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
Recently, many applications for Restricted Boltzmann Machines (RBMs) have been developed for a large variety of learning problems. However, RBMs are usually used as feature extrac...
AAAI
2000
14 years 11 months ago
2000
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we present simple and genetic forms of an evolutionary paradigm known as a society of hill-climbers (SoHC). We compare these simple and genetic SoHCs on a test suite...