Sciweavers

2107 search results - page 291 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
TC
2002
13 years 8 months ago
The Timewheel Group Communication System
This paper describes a group communication system called the timewheel group communication system that has been designed for a timed asynchronous distributed system model. The tim...
Shivakant Mishra, Christof Fetzer, Flaviu Cristian
BMCBI
2006
175views more  BMCBI 2006»
13 years 9 months ago
Parameter estimation for stiff equations of biosystems using radial basis function networks
Background: The modeling of dynamic systems requires estimating kinetic parameters from experimentally measured time-courses. Conventional global optimization methods used for par...
Yoshiya Matsubara, Shinichi Kikuchi, Masahiro Sugi...
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
14 years 21 days ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
ATAL
2003
Springer
14 years 2 months ago
A method for decentralized clustering in large multi-agent systems
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...
PERCOM
2007
ACM
14 years 8 months ago
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real ...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...