Sciweavers

3819 search results - page 149 / 764
» Simple Easy Terms
Sort
View
CIAC
2000
Springer
118views Algorithms» more  CIAC 2000»
15 years 11 months ago
Speeding Up Pattern Matching by Text Compression
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Ma...
DL
2000
Springer
164views Digital Library» more  DL 2000»
15 years 11 months ago
Scalable browsing for large collections: a case study
Phrase browsing techniques use phrases extracted automatically from a large information collection as a basis for browsing and accessing it. This paper describes a case study that...
Gordon W. Paynter, Ian H. Witten, Sally Jo Cunning...
AI
1998
Springer
15 years 11 months ago
A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
Jean Berger, Martin Salois, Regent Begin
INFOCOM
1997
IEEE
15 years 11 months ago
Channel Carrying: A Novel Handoff Scheme for Mobile Cellular Networks
— We present a new scheme that addresses the call handoff problem in mobile cellular networks. Efficiently solving the handoff problem is important for guaranteeing quality of s...
Junyi Li, Ness B. Shroff, Edwin K. P. Chong
ISCA
1993
IEEE
137views Hardware» more  ISCA 1993»
15 years 11 months ago
Transactional Memory: Architectural Support for Lock-Free Data Structures
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...
Maurice Herlihy, J. Eliot B. Moss