Sciweavers

363 search results - page 54 / 73
» Requirement Indicators for Mobile Work: The MOWAHS Approach
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
ANSS
2006
IEEE
14 years 1 months ago
Swarm-based Active Tunable Routing for Overhead Reduction in Multiservice Networks
The explosive growth of multimedia and other bandwidth intensive applications has resulted a rapid increase in the size of the traffic loads that needs to be supported by modern n...
Constandinos X. Mavromoustakis, Helen D. Karatza
CICLING
2005
Springer
14 years 1 months ago
Incremental Information Extraction Using Tree-Based Context Representations
Abstract. The purpose of information extraction (IE) is to find desired pieces of information in natural language texts and store them in a form that is suitable for automatic pro...
Christian Siefkes
VTS
2002
IEEE
109views Hardware» more  VTS 2002»
14 years 19 days ago
Controlling Peak Power During Scan Testing
This paper presents a procedure for modifying a given set of scan vectors so that the peak power during scan testing is kept below a specified limit without reducing fault coverag...
Ranganathan Sankaralingam, Nur A. Touba
ADC
2000
Springer
326views Database» more  ADC 2000»
14 years 2 days ago
T-Tree or B-Tree: Main Memory Database Index Structure Revisited
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
Hongjun Lu, Yuet Yeung Ng, Zengping Tian