Sciweavers

14548 search results - page 2435 / 2910
» The Optimal Path-Matching Problem
Sort
View
ISCI
2008
116views more  ISCI 2008»
15 years 7 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
JAIR
2008
110views more  JAIR 2008»
15 years 7 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
IJON
2006
146views more  IJON 2006»
15 years 7 months ago
Feature selection and classification using flexible neural tree
The purpose of this research is to develop effective machine learning or data mining techniques based on flexible neural tree FNT. Based on the pre-defined instruction/operator se...
Yuehui Chen, Ajith Abraham, Bo Yang
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 7 months ago
Target assignment for robotic networks: asymptotic performance under limited communication
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
Stephen L. Smith, Francesco Bullo
IVC
2006
146views more  IVC 2006»
15 years 7 months ago
Reconfigurable omnidirectional camera array calibration with a linear moving object
Reconfigurable omnidirectional camera arrays are useful for applications where multiple cameras working together are to be deployed at a short notice. This paper proposes a multi-...
Tarak Gandhi, Mohan M. Trivedi
« Prev « First page 2435 / 2910 Last » Next »