3652 search results - page 469 / 731 » A study of query length |
175
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
—On-demand routing reduces the control overhead in mobile ad hoc networks, but it has the major drawback of introducing latency between route-request arrival and the determinatio...
178
click to vote
ISCC
2003
IEEE
15 years 12 months ago
2003
IEEE
Host-based rerouting mechanism is a routing scheme that stores and forwards data in application layer. With this, users can communicate in a indirect way. Thus, identity informati...
163
click to vote
COCO
2003
Springer
15 years 12 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
188
click to vote
COLT
2003
Springer
15 years 12 months ago
2003
Springer
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=−log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomon...
153
click to vote
EVOW
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...