Sciweavers

551 search results - page 89 / 111
» Continuous Search in Constraint Programming
Sort
View
EVOW
2009
Springer
14 years 2 months ago
A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse
We consider a real-world problem arising in a warehouse for spare parts. Items ordered by customers shall be collected and for this purpose our task is to determine efficient picku...
Matthias Prandtstetter, Günther R. Raidl, Tho...
AHS
2007
IEEE
253views Hardware» more  AHS 2007»
14 years 2 months ago
evolFIR: Evolving redundancy-free FIR structures
Finite impulse response (FIR) structures are the most commonly used digital filters and can be found in various areas of everyday life. In this paper we introduce a novel approac...
Szilvia Zvada, Gabriella Kókai, Róbe...
CP
2005
Springer
14 years 1 months ago
Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
Martí Sánchez, Javier Larrosa, Pedro...
CP
2005
Springer
14 years 1 months ago
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
Roie Zivan, Amnon Meisels
CP
2006
Springer
13 years 11 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter