Sciweavers

1984 search results - page 9 / 397
» The colourful feasibility problem
Sort
View
EAAI
2008
104views more  EAAI 2008»
14 years 9 months ago
Feasible distributed CSP models for scheduling problems
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Miguel A. Salido, Adriana Giret
ENDM
2007
69views more  ENDM 2007»
14 years 9 months ago
Feasibility of the Mixed Postman Problem with Restrictions on the Edges
Francisco Javier Zaragoza Martínez
92
Voted
COR
2011
14 years 4 months ago
On the application of graph colouring techniques in round-robin sports scheduling
The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. U...
R. Lewis, J. Thompson