14548 search results - page 56 / 2910 » The Optimal Path-Matching Problem |
TNN
1998
13 years 9 months ago
1998
—In this paper we examine a technique by which fault tolerance can be embedded into a feedforward network leading to a network tolerant to the loss of a node and its associated w...
ICDE
2012
IEEE
12 years 12 days ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
DATE
2010
IEEE
13 years 8 months ago
2010
IEEE
—Model-Based Development (MBD) provides an al level of abstraction, the model, which lets engineers focus on the business aspect of the developed system. MBD permits automatic tr...
COLT
2010
Springer
13 years 8 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
EMO
2003
Springer
14 years 3 months ago
2003
Springer
In this paper a Population-based Ant Colony Optimization approach is proposed to solve multi-criteria optimization problems where the population of solutions is chosen from the set...