Sciweavers

2254 search results - page 383 / 451
» Computing the minimal covering set
Sort
View
ECML
2006
Springer
14 years 1 months ago
Cost-Sensitive Decision Tree Learning for Forensic Classification
Abstract. In some learning settings, the cost of acquiring features for classification must be paid up front, before the classifier is evaluated. In this paper, we introduce the fo...
Jason V. Davis, Jungwoo Ha, Christopher J. Rossbac...
EVOW
2006
Springer
14 years 1 months ago
Optimal Broadcasting in Metropolitan MANETs Using Multiobjective Scatter Search
Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenari...
Francisco Luna, Antonio J. Nebro, Bernabé D...
APLAS
2003
ACM
14 years 1 months ago
Resource Usage Verification
We investigate how to automatically verify that resources such as files are not used improperly or unsafely by a program. We employ a mixture of compile-time analysis and run-time ...
Kim Marriott, Peter J. Stuckey, Martin Sulzmann
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
14 years 1 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
AAAI
2008
14 years 10 days ago
Efficient Optimization of Information-Theoretic Exploration in SLAM
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
Thomas Kollar, Nicholas Roy