Sciweavers

13376 search results - page 322 / 2676
» Problem Solving with
Sort
View
CSR
2010
Springer
15 years 9 months ago
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
Uwe Schöning
CEEMAS
2007
Springer
15 years 8 months ago
Exploring Social Networks in Request for Proposal Dynamic Coalition Formation Problems
In farsighted MAS, every agent is aware of each other, and so they can evaluate the outcomes of their interaction in an efficient way. However, this farsighted knowledge becomes an...
Carlos Mérida-Campos, Steven Willmott
JSCIC
2008
79views more  JSCIC 2008»
15 years 4 months ago
A New Ghost Cell/Level Set Method for Moving Boundary Problems: Application to Tumor Growth
Abstract In this paper, we present a ghost cell/level set method for the evolution of interfaces whose normal velocity depend upon the solutions of linear and nonlinear quasi-stead...
Paul Macklin, John Lowengrub
JSAT
2006
109views more  JSAT 2006»
15 years 4 months ago
Decomposing SAT Problems into Connected Components
Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This o...
Armin Biere, Carsten Sinz
PVLDB
2010
110views more  PVLDB 2010»
15 years 2 months ago
Evaluation of entity resolution approaches on real-world match problems
Despite the huge amount of recent research efforts on entity resolution (matching) there has not yet been a comparative evaluation on the relative effectiveness and efficiency of ...
Hanna Köpcke, Andreas Thor, Erhard Rahm