16188 search results - page 365 / 3238 » The Optimal PAC Algorithm |
152
click to vote
ESA
2004
Springer
16 years 4 days ago
2004
Springer
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
175
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
183
click to vote
IWANN
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Mechanisms for adapting models, filters, regulators and so on to changing properties of a system are of fundamental importance in many modern identification, estimation...
163
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
178
click to vote
TMM
2008
15 years 6 months ago
2008
Abstract--Traditional video servers partially cope with heterogeneous client populations by maintaining a few versions of the same stream with different bit rates. More recent vide...