Sciweavers

1403 search results - page 61 / 281
» On Communication in Solving Distributed Constraint Satisfact...
Sort
View
CPAIOR
2007
Springer
15 years 10 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...
136
Voted
ICPP
2005
IEEE
15 years 9 months ago
Peak Power Control for a QoS Capable On-Chip Network
In recent years integrating multiprocessors in a single chip is emerging for supporting various scientific and commercial applications, with diverse demands to the underlying on-c...
Yuho Jin, Eun Jung Kim, Ki Hwan Yum
230
Voted
CP
2009
Springer
16 years 4 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
141
Voted
EAAI
2007
154views more  EAAI 2007»
15 years 3 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho
137
Voted
ATAL
2007
Springer
15 years 10 months ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe