2089 search results - page 45 / 418 » A New Problem in String Searching |
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
COR
2010
14 years 9 months ago
2010
In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant consider...
116
click to vote
STRINGOLOGY
2004
14 years 11 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
PRICAI
2004
Springer
15 years 3 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
KR
2004
Springer
15 years 3 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...