Sciweavers

285 search results - page 48 / 57
» The complexity of soft constraint satisfaction
Sort
View
ESWS
2007
Springer
15 years 3 months ago
Vague Knowledge Bases for Matchmaking in P2P E-Marketplaces
In this paper we propose an approach to semantic matchmaking that exploits various knowledge representation technologies to find most promising partners in peer-to-peer e-marketpl...
Azzurra Ragone, Umberto Straccia, Tommaso Di Noia,...
CP
2005
Springer
15 years 3 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...
DT
2008
75views more  DT 2008»
14 years 9 months ago
Application Scenarios in Streaming-Oriented Embedded-System Design
In the past decade real-time embedded systems became more and more complex and pervasive. From the user perspective, these systems have stringent requirements regarding size, perfo...
Stefan Valentin Gheorghita, Twan Basten, Henk Corp...
CPAIOR
2007
Springer
15 years 3 months ago
A Position-Based Propagator for the Open-Shop Problem
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
Jean-Noël Monette, Yves Deville, Pierre Dupon...
CP
2006
Springer
15 years 1 months ago
Interactive Distributed Configuration
Interactive configuration is the concept of assisting a user in selecting values for parameters that respect given constraints. It was originally inspired by the product configurat...
Peter Tiedemann, Tarik Hadzic, Thomas Stuart Henne...