Sciweavers

29 search results - page 5 / 6
» Provably competitive adaptive routing
Sort
View
INFOCOM
2010
IEEE
13 years 3 months ago
Adaptive Calibration for Fusion-based Wireless Sensor Networks
Abstract—Wireless sensor networks (WSNs) are typically composed of low-cost sensors that are deeply integrated with physical environments. As a result, the sensing performance of...
Rui Tan, Guoliang Xing, Xue Liu, Jianguo Yao, Zhao...
ICML
2006
IEEE
14 years 6 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth
AI
2010
Springer
13 years 5 months ago
Kernel functions for case-based planning
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
Ivan Serina
JAIR
2006
90views more  JAIR 2006»
13 years 5 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
INFOCOM
2007
IEEE
13 years 11 months ago
DEFT: Distributed Exponentially-Weighted Flow Splitting
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
Dahai Xu, Mung Chiang, Jennifer Rexford