Sciweavers

5230 search results - page 891 / 1046
» Dynamic Optimality -- Almost
Sort
View
MIDDLEWARE
2005
Springer
14 years 3 months ago
Adaptive query processing in mobile environment
These last years, the evolution of nomadic terminals and mobile networks has yield to the development of the ubiquitous computing. In this context, actual query evaluation and opt...
Hocine Grine, Thierry Delot, Sylvain Lecomte
PAM
2005
Springer
14 years 3 months ago
Self-Learning IP Traffic Classification Based on Statistical Flow Characteristics
A number of key areas in IP network engineering, management and surveillance greatly benefit from the ability to dynamically identify traffic flows according to the applications re...
Sebastian Zander, Thuy T. T. Nguyen, Grenville J. ...
SARA
2005
Springer
14 years 3 months ago
Solving the 24 Puzzle with Instance Dependent Pattern Databases
A pattern database (PDB) is a heuristic function in a form of a lookup table which stores the cost of optimal solutions for instances of subproblems. bproblems are generated by abs...
Ariel Felner, Amir Adler
VLDB
2005
ACM
119views Database» more  VLDB 2005»
14 years 3 months ago
Database-Inspired Search
“W3QL: A Query Language for the WWW”, published in 1995, presented a language with several distinctive features. Employing existing indexes as access paths, it allowed the sel...
David Konopnicki, Oded Shmueli
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
14 years 3 months 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...