Sciweavers

1508 search results - page 196 / 302
» Efficient Path Profiling
Sort
View
IPPS
2006
IEEE
14 years 3 months ago
Ant-inspired query routing performance in dynamic peer-to-peer networks
P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on qu...
Mojca Ciglaric, Tone Vidmar
ISCIS
2005
Springer
14 years 2 months ago
Admission Control for Multicast Routing with Quality of Service in Ad Hoc Networks
Ad hoc networks, being able to organize themselves without user intervention, can easily provide their users with mobility, multimedia support and group communication. However, the...
Kaan Bür, Cem Ersoy
BTW
1999
Springer
157views Database» more  BTW 1999»
14 years 1 months ago
Database Primitives for Spatial Data Mining
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
Martin Ester, Stefan Grundlach, Hans-Peter Kriegel...
SIGGRAPH
1994
ACM
14 years 1 months ago
Drawing and animation using skeletal strokes
strokes makes it particularly attractive in terms of storage size and transmission efficiency. Its efficient implementation is favourable for incorporation into windowing systems a...
Siu Chi Hsu, Irene H. H. Lee
AIPS
2006
13 years 10 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley