Sciweavers

33 search results - page 4 / 7
» Experimental Studies of Symbolic Shortest-Path Algorithms
Sort
View
ALGOSENSORS
2009
Springer
13 years 10 months ago
Routing on Delay Tolerant Sensor Networks
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
Michael Keane, Evangelos Kranakis, Danny Krizanc, ...
GREC
2007
Springer
13 years 11 months ago
ARG Based on Arcs and Segments to Improve the Symbol Recognition by Genetic Algorithm
In this paper a genetic matching scheme is extended to take into account primitive arcs and complex description in the pattern recognition process. Classical ways only focus on seg...
J.-P. Salmon, Laurent Wendling
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
14 years 7 months ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
CORR
2010
Springer
150views Education» more  CORR 2010»
13 years 7 months ago
Extraction of Symbolic Rules from Artificial Neural Networks
Although backpropagation ANNs generally predict better than decision trees do for pattern classification problems, they are often regarded as black boxes, i.e., their predictions c...
S. M. Kamruzzaman, Md. Monirul Islam
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 27 days ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki