Sciweavers

2343 search results - page 18 / 469
» Visual-Concept Search Solved
Sort
View
186
Voted
CP
2009
Springer
16 years 1 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck
110
Voted
GECCO
1999
Springer
158views Optimization» more  GECCO 1999»
15 years 5 months ago
Coevolutionary Genetic Algorithms for Solving Dynamic Constraint Satisfaction Problems
In this paper, we discuss the adaptability of Coevolutionary Genetic Algorithms on dynamic environments. Our CGA consists of two populations: solution-level one and schema-level o...
Hisashi Handa, Osamu Katai, Tadataka Konishi, Mits...
122
Voted
ICCS
2003
Springer
15 years 6 months ago
Implementation of a Grid-Enabled Problem Solving Environment in Matlab
In many areas of design search and optimisation one needs to utilize Computational Fluid Dynamics (CFD) methods in order to obtain numerical solution of the flow field in and/or ...
M. Hakki Eres, Graeme E. Pound, Zhuoan Jiao, Jasmi...
125
Voted
DATESO
2007
103views Database» more  DATESO 2007»
15 years 2 months ago
Using BMH Algorithm to Solve Subset of XPath Queries
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
David Toth
112
Voted
IJCAI
2003
15 years 2 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
Christian Bessière, Anaïs Fabre, Ulric...