536 search results - page 8 / 108 » Efficient Search Using Bitboard Models |
CADE
2006
Springer
16 years 1 days ago
2006
Springer
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
This paper proposes a new niching method named hierarchical niching, which combines spatial niching in search space and a continuous temporal niching concept. The method is natural...
203
click to vote
ICDE
2002
IEEE
16 years 1 months ago
2002
IEEE
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
HEURISTICS
2010
14 years 6 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
ICML
2006
IEEE
16 years 16 days ago
2006
IEEE
We present a Bayesian search algorithm for learning the structure of latent variable models of continuous variables. We stress the importance of applying search operators designed...