Sciweavers

929 search results - page 56 / 186
» heuristics 2008
Sort
View
AAAI
2008
13 years 10 months ago
Fast Planning by Search in Domain Transition Graph
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...
Yixin Chen, Ruoyun Huang, Weixiong Zhang
DCOSS
2008
Springer
13 years 9 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
13 years 9 months ago
Oblivious Randomized Direct Search for Real-Parameter Optimization
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
Jens Jägersküpper
CISIS
2008
IEEE
13 years 7 months ago
A Study of Maximum Lifetime Routing in Sparse Sensor Networks
A major issue in wireless sensor networks is to prolong network lifetime by efficient energy management. In this paper we present an initial study of maximum lifetime routing in s...
Ewa Hansen, Mikael Nolin, Mats Björkman
ML
2008
ACM
135views Machine Learning» more  ML 2008»
13 years 7 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget