Sciweavers

9631 search results - page 279 / 1927
» The Costs of Using JXTA
Sort
View

Publication
2630views
17 years 6 months ago
DIJKSTRA’S and Fast Marching Method for Optimal Path Planning
This technical report illustrates the differences in solving the optimal path problem (shortest path) using different methods, where the underlying PDE can be described by the eik...
RYO TAKEI
NOMS
2006
IEEE
16 years 24 days ago
An Enhanced Estimator to Multi-objective OSPF Weight Setting Problem
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...
Mohammed H. Sqalli, Sadiq M. Sait, Mohammed Aijaz ...
ICPR
2004
IEEE
16 years 8 months ago
An Image Watermarking Scheme using HVS Characteristics and Spread Transform
The paper presents a robust digital image watermarking scheme that uses both the characteristics of the human visual system (HVS) and statistical information measure. Spread trans...
Malay Kumar Kundu, Santi P. Maity
AGENTCL
2000
Springer
15 years 11 months ago
Using Colored Petri Nets for Conversation Modeling
Conversations are a useful means of structuring communicative interactions among agents. The value of a conversation-based approach is largely determined by the conversational mod...
R. Scott Cost, Ye Chen, Timothy W. Finin, Yannis L...
APSEC
1999
IEEE
15 years 11 months ago
Slicing Methods Using Static and Dynamic Analysis Information
In this paper, we propose four slicing methods using both static and dynamic analysis information. (1) StatementMark Slice : removes the unnecessary statements using an execution ...
Yoshiyuki Ashida, Fumiaki Ohata, Katsuro Inoue