Sciweavers

322 search results - page 5 / 65
» Least Expected Cost Query Optimization: What Can We Expect
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Toward Optimal Network Fault Correction via End-to-End Inference
— We consider an end-to-end approach of inferring network faults that manifest in multiple protocol layers, with an optimization goal of minimizing the expected cost of correctin...
Patrick P. C. Lee, Vishal Misra, Dan Rubenstein
ALT
2009
Springer
14 years 4 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
ASPDAC
2000
ACM
97views Hardware» more  ASPDAC 2000»
13 years 11 months ago
Symbolic debugging of globally optimized behavioral specifications
Symbolic debuggers are system development tools that can accelerate the validation speed of behavioral specifications by allowing a user to interact with an executing code at the ...
Inki Hong, Darko Kirovski, Miodrag Potkonjak, Mari...
WIOPT
2011
IEEE
12 years 11 months ago
Open loop optimal control of base station activation for green networks
Abstract—In recent years there has been an increasing awareness that the deployment as well as utilization of new information technology may have some negative ecological impact....
Sreenath Ramanath, Veeraruna Kavitha, Eitan Altman
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
13 years 7 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri