Sciweavers

536 search results - page 8 / 108
» Efficient Search Using Bitboard Models
Sort
View
CADE
2006
Springer
14 years 7 months ago
Geometric Resolution: A Proof Procedure Based on Finite Model Search
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...
Hans de Nivelle, Jia Meng
GECCO
2004
Springer
132views Optimization» more  GECCO 2004»
14 years 26 days ago
Robust and Efficient Genetic Algorithms with Hierarchical Niching and a Sustainable Evolutionary Computation Model
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...
Jianjun Hu, Erik D. Goodman
ICDE
2002
IEEE
163views Database» more  ICDE 2002»
14 years 8 months ago
Keyword Searching and Browsing in Databases using BANKS
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...
Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, So...
HEURISTICS
2010
13 years 2 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
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...
Claude-Guy Quimper, Louis-Martin Rousseau
ICML
2006
IEEE
14 years 8 months ago
Bayesian learning of measurement and structural models
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...
Ricardo Silva, Richard Scheines