Sciweavers

838 search results - page 118 / 168
» Finding Optimal Solutions to Atomix
Sort
View
TON
2008
119views more  TON 2008»
14 years 11 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
BTW
2005
Springer
113views Database» more  BTW 2005»
15 years 5 months ago
A Learning Optimizer for a Federated Database Management System
: Optimizers in modern DBMSs utilize a cost model to choose an efficient query execution plan (QEP) among all possible ones for a given query. The accuracy of the cost estimates de...
Stephan Ewen, Michael Ortega-Binderberger, Volker ...
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
16 years 5 days ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
ICIP
1997
IEEE
16 years 1 months ago
Bit Allocation Methods for Closed-Loop Coding of Oversampled Pyramid Decompositions
Oversampled pyramid decompositions have been successfully applied to scalable video coding. Quantization noise feedback at the encoder closed-loop coding" has several advant...
Uwe Horn, Thomas Wiegand, Bernd Girod
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 3 months ago
Multi-step environment learning classifier systems applied to hyper-heuristics
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
Javier G. Marín-Blázquez, Sonia Schu...