Sciweavers

5169 search results - page 258 / 1034
» Locality approximation using time
Sort
View
HASE
2008
IEEE
16 years 1 months ago
Localizing Program Errors via Slicing and Reasoning
Model-based program debugging exploits discrepancies between the program behavior anticipated by a programmer and the program’s actual behavior when executed on a set of inputs....
Fei Pu, Yan Zhang
MOBIDE
2006
ACM
16 years 17 days ago
GPS-Free node localization in mobile wireless sensor networks
An important problem in mobile ad-hoc wireless sensor networks is the localization of individual nodes, i.e., each node’s awareness of its position relative to the network. In t...
Hüseyin Akcan, Vassil Kriakov, Hervé B...
WWW
2009
ACM
16 years 7 months ago
Combining global optimization with local selection for efficient QoS-aware service composition
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
Mohammad Alrifai, Thomas Risse
CN
2002
102views more  CN 2002»
15 years 6 months ago
On the impact of soft handoff in cellular systems
We present a model for soft handoff in wireless cellular networks. In such networks, due to overlapping cells, handoffs are not instantaneous and multiple channels may be occupied...
Nidhi Hegde, Khosrow Sohraby
STACS
2005
Springer
16 years 3 days ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning