3818 search results - page 212 / 764 » Word Problems on Compressed Words |
164
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
: - In this paper we address two problems, for which we present novel, efficient, algorithmic solutions. The first problem is motivated by practical situations and is concerned wit...
175
click to vote
DAM
2008
15 years 6 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
149
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
147
click to vote
IPL
2006
15 years 6 months ago
2006
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
143
click to vote
IPL
2007
15 years 6 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...