3446 search results - page 101 / 690 » A Reasoning Algorithm for pD* |
129
click to vote
PERCOM
2007
ACM
15 years 7 months ago
2007
ACM
A substantial amount of research on routing in sensor networks has focused upon methods for constructing the best route, or routes, from data source to sink before sending the dat...
117
click to vote
EVOW
2007
Springer
15 years 7 months ago
2007
Springer
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary...
116
click to vote
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
92
Voted
PAKDD
2005
ACM
15 years 7 months ago
2005
ACM
Abstract. The data stream model of computation is often used for analyzing huge volumes of continuously arriving data. In this paper, we present a novel algorithm called DUCstream ...