Sciweavers

6315 search results - page 1165 / 1263
» Approximating Solution Structure
Sort
View
CCR
2002
97views more  CCR 2002»
13 years 10 months ago
Multi-modal network protocols
Most network protocols are uni-modal: they employ a single set of algorithms that allows them to cope well only within a narrow range of operating conditions. This rigid design re...
Rajesh Krishna Balan, Aditya Akella, Srinivasan Se...
TCS
1998
13 years 9 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
PVLDB
2008
126views more  PVLDB 2008»
13 years 9 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
INFORMS
2010
138views more  INFORMS 2010»
13 years 8 months ago
Pruning Moves
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
Matteo Fischetti, Domenico Salvagnin
ACSAC
2010
IEEE
13 years 6 months ago
Heap Taichi: exploiting memory allocation granularity in heap-spraying attacks
Heap spraying is an attack technique commonly used in hijacking browsers to download and execute malicious code. In this attack, attackers first fill a large portion of the victim...
Yu Ding, Tao Wei, Tielei Wang, Zhenkai Liang, Wei ...
« Prev « First page 1165 / 1263 Last » Next »