70 search results - page 2 / 14 » Fine-Tuning of Algorithms Using Fractional Experimental Desi... |
TSMC
2011
13 years 2 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
GECCO
2003
Springer
14 years 22 days ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
CONSTRAINTS
2007
13 years 7 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
Unequal loss protection with systematic Reed-Solomon codes allows reliable transmission of embedded multimedia over packet erasure channels. The design of a fast algorithm with lo...