Sciweavers

160 search results - page 28 / 32
» Boosting Distributed Constraint Satisfaction
Sort
View
AAAI
2006
13 years 9 months ago
The Impact of Balancing on Problem Hardness in a Highly Structured Domain
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...
Carlos Ansótegui, Ramón Béjar...
CP
2007
Springer
14 years 2 months ago
Scheduling Conditional Task Graphs
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...
Michele Lombardi, Michela Milano
CP
1998
Springer
14 years 5 days ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
AMET
1998
Springer
14 years 5 days ago
Agent-Mediated Integrative Negotiation for Retail Electronic Commerce
Software agents help automate a variety of tasks including those involved in buying and selling products over the Internet. Although shopping agents provide convenience for consume...
Robert H. Guttman, Pattie Maes
FLAIRS
2004
13 years 9 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels