Sciweavers

8377 search results - page 333 / 1676
» Scenarios - Introduction
Sort
View
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
16 years 4 days ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
ISSTA
2004
ACM
16 years 3 days ago
Covering arrays for efficient fault characterization in complex configuration spaces
—Many modern software systems are designed to be highly configurable so they can run on and be optimized for a wide variety of platforms and usage scenarios. Testing such systems...
Cemal Yilmaz, Myra B. Cohen, Adam A. Porter
MOBICOM
2004
ACM
16 years 3 days ago
A study on the feasibility of mobile gateways for vehicular ad-hoc networks
Development in Wireless LAN and Cellular technologies has motivated recent efforts to integrate the two. This creates new application scenarios that were not possible before. Veh...
Vinod Namboodiri, Manish Agarwal, Lixin Gao
SAC
2004
ACM
16 years 3 days ago
Creation and management of versions in multiversion data warehouse
A data warehouse (DW) provides an information for analytical processing, decision making, and data mining tools. On the one hand, the structure and content of a data warehouse ref...
Bartosz Bebel, Johann Eder, Christian Koncilia, Ta...
SC
2004
ACM
16 years 3 days ago
Rating Compiler Optimizations for Automatic Performance Tuning
To achieve maximum performance gains through compiler optimization, most automatic performance tuning systems use a feed-back directed approach to rate the code versions generated...
Zhelong Pan, Rudolf Eigenmann