14548 search results - page 410 / 2910 » The Optimal Path-Matching Problem |
153
click to vote
LATA
2010
Springer
16 years 1 months ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
166
click to vote
CSO
2009
IEEE
16 years 1 months ago
2009
IEEE
When a paid price discount activity occurs, the decisionmaker must decide whether or not and when to pay the additional fees for preferential price in an online fashion. This prob...
152
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
We address a large scale waste collection vehicle routing problem with time windows (VRPTW) complicated by multiple disposal trips and drivers lunch breaks. A fitness search spac...
177
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
152
click to vote
WEA
2007
Springer
16 years 27 days ago
2007
Springer
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...