14386 search results - page 220 / 2878 » The Chinese Generals Problem |
134
click to vote
COLING
2010
14 years 11 months ago
2010
Temporal expressions in texts contain significant temporal information. Understanding temporal information is very useful in many NLP applications, such as information extraction,...
120
click to vote
EOR
2010
15 years 4 months ago
2010
In the last decade, there has been an increasing body of research in dynamic vehicle routing problems. This article surveys the subclass of those problems called dynamic pickup an...
130
click to vote
IPL
2008
15 years 4 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
131
click to vote
EUSFLAT
2001
15 years 5 months ago
2001
A single machine scheduling problem with parameters given in the form of fuzzy numbers is considered. It is assumed that the optimal schedule in such a problem cannot be determine...
132
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...