Sciweavers

101 search results - page 2 / 21
» Optimization Issues in R-tree Construction (Extended Abstrac...
Sort
View
TON
2010
171views more  TON 2010»
14 years 4 months ago
Constructing Maximum-Lifetime Data-Gathering Forests in Sensor Networks
Abstract--Energy efficiency is critical for wireless sensor networks. The data-gathering process must be carefully designed to conserve energy and extend network lifetime. For appl...
Yan Wu, Zhoujia Mao, Sonia Fahmy, Ness B. Shroff
CORR
2008
Springer
154views Education» more  CORR 2008»
14 years 9 months ago
A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes
rexample Guided Abstraction-Refinement Framework for Markov Decision Processes ROHIT CHADHA and MAHESH VISWANATHAN Dept. of Computer Science, University of Illinois at Urbana-Champ...
Rohit Chadha, Mahesh Viswanathan
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 4 months ago
Exploiting symmetries in SDP-relaxations for polynomial optimization
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
Cordian Riener, Thorsten Theobald, Lina Jansson An...
CORR
2011
Springer
148views Education» more  CORR 2011»
14 years 1 months ago
Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress)
extended abstract we report on work in progress carried out within the framework of the NWO project Realising Optimal Sharing. Instead of discussing optimal reduction in the λ-cal...
Jan Rochel, Clemens Grabmayer
ML
2010
ACM
159views Machine Learning» more  ML 2010»
14 years 8 months ago
Algorithms for optimal dyadic decision trees
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Don R. Hush, Reid B. Porter