1548 search results - page 119 / 310 » Statistical Modelling of CSP Solving Algorithms Performance |
175
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
183
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Before the advent of Hidden Markov Models(HMM)-based speech recognition, many speech applications were built using pattern matching algorithms like the Dynamic Time Warping (DTW) ...
170
click to vote
HPCC
2005
Springer
16 years 8 days ago
2005
Springer
This study concerns a threshold-based matching algorithm for Clos (t-MAC) network switches. The studied Clos network uses a central photonic switch fabric for transporting high-spe...
182
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
197
click to vote
CONSTRAINTS
2007
15 years 6 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...