Sciweavers

1040 search results - page 12 / 208
» Tools for modeling and solving search problems
Sort
View
BNCOD
2004
397views Database» more  BNCOD 2004»
14 years 11 months ago
DbSurfer: A Search and Navigation Tool for Relational Databases
Abstract. We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails...
Richard Wheeldon, Mark Levene, Kevin Keenoy
AISC
2008
Springer
15 years 4 days ago
Strategies for Solving SAT in Grids by Randomized Search
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
15 years 3 months ago
Solving large scale combinatorial optimization using PMA-SLS
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
Jing Tang, Meng-Hiot Lim, Yew-Soon Ong, Meng Joo E...
CPAIOR
2010
Springer
14 years 8 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
90
Voted
SOCO
2008
Springer
14 years 10 months ago
Tabu search for attribute reduction in rough set theory
Attribute reduction of an information system is a key problem in rough set theory and its applications. Using computational intelligence (CI) tools to solve such problems has rece...
Abdel-Rahman Hedar, Jue Wang, Masao Fukushima