Sciweavers

962 search results - page 121 / 193
» Toward Optimal Feature Selection
Sort
View
130
Voted
PERCOM
2005
ACM
16 years 3 months ago
When Does Opportunistic Routing Make Sense?
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
Adam Wolisz, Jan M. Rabaey, Rahul C. Shah, Sven Wi...
90
Voted
ATAL
2008
Springer
15 years 5 months ago
Identifying beneficial teammates using multi-dimensional trust
Multi-agent teams must be capable of selecting the most beneficial teammates for different situations. Multi-dimensional trustworthiness assessments have been shown significantly ...
Jaesuk Ahn, Xin Sui, David DeAngelis, K. Suzanne B...
126
Voted
HEURISTICS
2002
152views more  HEURISTICS 2002»
15 years 3 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
122
Voted
LION
2009
Springer
129views Optimization» more  LION 2009»
15 years 10 months ago
Expeditive Extensions of Evolutionary Bayesian Probabilistic Neural Networks
Abstract. Probabilistic Neural Networks (PNNs) constitute a promising methodology for classification and prediction tasks. Their performance depends heavily on several factors, su...
Vasileios L. Georgiou, Sonia Malefaki, Konstantino...
103
Voted
ICPR
2008
IEEE
15 years 10 months ago
Robust indoor activity recognition via boosting
In this paper, a novel statistical indoor activity recognition algorithm is introduced. While conditional random fields (CRFs) have prominent properties to this task, no optimal ...
Masamichi Shimosaka, Taketoshi Mori, Tomomasa Sato