For probabilistic reasoning, one often needs to sample from a combinatorial space. For example, one may need to sample uniformly from the space of all satisfying assignments. Can ...
Inspired with Version Space learning, the Iterated Version Space Algorithm (IVSA) has been designed and implemented to learn disjunctive concepts. IVSA dynamically partitions its s...
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
—In recent years, there has been a move toward supporting the human element of Web search beyond a simple query box and a ranked list of search results. In this paper, we present...
When searching the space of possible plans for combined planning and scheduling problems we often reach a local maximum and must either backtrack or otherwise modify the plan to m...