Sciweavers

2109 search results - page 24 / 422
» Solving Necklace Constraint Problems
Sort
View
AMC
2005
206views more  AMC 2005»
15 years 1 months ago
Logistics networks: A game theory application for solving the transshipment problem
As competition from emerging economies such as China and India puts pressure on global supply chains and as new constraints emerge, it presents opportunities for approaches such a...
Pedro M. Reyes
PRICAI
2004
Springer
15 years 7 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
ESANN
2007
15 years 3 months ago
Several ways to solve the MSO problem
The so called MSO-problem, – a simple superposition of two or more sinusoidal waves –, has recently been discussed as a benchmark problem for reservoir computing and was shown ...
Jochen J. Steil
CAD
2010
Springer
15 years 2 months ago
A non-rigid cluster rewriting approach to solve systems of 3D geometric constraints
We present a new constructive solving approach for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large sy...
Hilderick A. van der Meiden, Willem F. Bronsvoort
WSCG
2004
118views more  WSCG 2004»
15 years 3 months ago
New Method for Geometric Constraint Solving Based on the Genetic Quantum Algorithm
This paper proposes a novel genetic quantum algorithm (GQA) to solve geometric constraint problems. Instead of binary, numeric or symbolic representation, we introduce qubit chrom...
Chunhong Cao, Wenhui Li