692 search results - page 33 / 139 » Some research questions for computational transportation sci... |
MP
2007
13 years 8 months ago
2007
The question of nonemptiness of the intersection of a nested sequence of closed sets is fundamental in a number of important optimization topics, including the existence of optima...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
MFCS
1994
Springer
14 years 18 days ago
1994
Springer
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
HICSS
2005
IEEE
14 years 2 months ago
2005
IEEE
Substantial financial and technological investments by private and public organizations have resulted in the delivery of the third generation mobile technologies, although the jou...