475 search results - page 32 / 95 » Feasible distributed CSP models for scheduling problems |
153
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
209
click to vote
PATAT
2004
Springer
15 years 10 months ago
2004
Springer
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
152
click to vote
JOIN
2007
15 years 4 months ago
2007
— One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formul...
164
click to vote
ICPADS
1998
IEEE
15 years 8 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
170
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...