Sciweavers

1646 search results - page 297 / 330
» fast 2007
Sort
View
CCR
2007
119views more  CCR 2007»
13 years 8 months ago
Exploiting KAD: possible uses and misuses
Peer-to-peer systems have seen a tremendous growth in the last few years and peer-to-peer traffic makes a major fraction of the total traffic seen in the Internet. The dominating ...
Moritz Steiner, Taoufik En-Najjary, Ernst W. Biers...
CN
2007
149views more  CN 2007»
13 years 8 months ago
Adaptive congestion protocol: A congestion control protocol with learning capability
There is strong evidence that the current implementation of TCP will perform poorly in future high speed networks. To address this problem many congestion control protocols have b...
Marios Lestas, Andreas Pitsillides, Petros A. Ioan...
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
13 years 8 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
ADHOC
2005
176views more  ADHOC 2005»
13 years 8 months ago
A survey of Mobile IP in cellular and Mobile Ad-Hoc Network environments
The Internet has become ubiquitous and there has been tremendous growth in wireless communications in recent years. Many wireless communication techniques are commercially availab...
Tin Yu Wu, Ching-Yang Huang, Han-Chieh Chao
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 8 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro