Sciweavers

189 search results - page 20 / 38
» Efficient Representation of Adhoc Constraints
Sort
View
ICIP
2001
IEEE
14 years 11 months ago
Optimal radial contour tracking by dynamic programming
A common problem in most active contour methods is that the recursive searching scheme can only return a local optimal solution. Furthermore, the internal energy of the snake is n...
Yunqiang Chen, Thomas S. Huang, Yong Rui
APNOMS
2006
Springer
14 years 1 months ago
NETSAQ: Network State Adaptive QoS Provisioning for MANETs
The provision of ubiquitous services in Mobile Ad-hoc Networks (MANETs) is a great challenge, considering the bandwidth, mobility, and computational-resources constraints exhibited...
Shafique Ahmad Chaudhry, Faysal Adeem Siddiqui, Al...
FGIT
2010
Springer
13 years 7 months ago
Improved Location Aided Cluster Based Routing Protocol for GPS Enabled Manets
Routing has been the main challenge for ad hoc networks due to dynamic topology as well as resource constraints. Completely GPS free as well as GPS scarce positioning systems for ...
S. Mangai, A. Tamilarasi
ER
2006
Springer
145views Database» more  ER 2006»
14 years 1 months ago
Combining Declarative and Procedural Knowledge to Automate and Represent Ontology Mapping
Ontologies on the Semantic Web are by nature decentralized. From the body of ontology mapping approaches, we can draw a conclusion that an effective approach to automate ontology m...
Li Xu, David W. Embley, Yihong Ding
AGP
1998
IEEE
14 years 1 months ago
Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos
The subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitabl...
Roberto Bagnara, Peter Schachte