526 search results - page 18 / 106 » Generalized benchmark generation for dynamic combinatorial p... |
158
Voted
CP
2009
Springer
15 years 10 months ago
2009
Springer
Millions of containers are stowed every week with goods worth billions of dollars, but container vessel stowage is an all but neglected combinatorial optimization problem. In this ...
TSMC
2011
14 years 4 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 ...
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
AIA
2007
14 years 11 months ago
2007
A fundamental assumption often made in supervised classification is that the problem is static, i.e. the description of the classes does not change with time. However many practi...
130
click to vote
LCTRTS
2001
Springer
15 years 2 months ago
2001
Springer
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...