Results 251 to 260 of about 1,094,283 (268)
Some of the next articles are maybe not open access.

Java based location independent desktop environment

1997
As the Internet grows and users become more mobile, users will need to be able to access from remote locations all of the same computing resources that they use in their offices. Some users accomplish this by taking everything with them, in the form of high-priced, high-powered laptop computers. This thesis investigates another possible solution to the
openaire   +1 more source

Locating independent facilities with maximum weight: Greedy heuristics

Omega, 1986
Abstract The problem is to locate a maximum-weight set of facilities such that no two are closer than a given distance from each other. The unweighted version is equivalent to the maximum independent set problem in graph theory. This paper presents four greedy heuristics and shows that they all have bad worst-case behavior.
Sohail S Chaudhry   +2 more
openaire   +1 more source

LIA: A LOCATION-INDEPENDENT TRANSFORMATION FOR ASOCS ADAPTIVE ALGORITHM 2

International Journal of Neural Systems, 1996
Most Artificial Neural Networks (ANNs) have a fixed topology during learning, and often suffer from a number of short-comings as a result. ANNs that use dynamic topologies have shown the ability to overcome many of these problems. Adaptive Self-Organizing Concurrent Systems (ASOCS) are a class of learning models with inherently dynamic topologies ...
G L, Rudolph, T R, Martinez
openaire   +2 more sources

A class of location-independent variability orders, with applications

Journal of Applied Probability, 2010
Li and Shaked (2007) introduced the family of generalized total time on test transform (TTT) stochastic orders, which is parameterized by a real function h that can be used to capture the preferences of a decision maker. It is natural to look for properties of these orders when there is an uncertainty in determining the appropriate function h.
Shaked, Moshe   +2 more
openaire   +2 more sources

A Location-Independent Energy Balanced Node-Covered Scheduling Algorithm

Wireless Personal Communications, 2017
Considering that existing node coverage scheduling algorithms are mostly based on the accurate location information and have the problems of higher overlap in coverage and lower regional coverage quality, a location-independent energy balanced node-covered scheduling algorithm is proposed.
Yanhui Lv   +3 more
openaire   +1 more source

Location Independent Coverage Control Algorithm for Wireless Sensor Networks

2010 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM), 2010
A location independent coverage control algorithm LICA is proposed in this paper. LICA adopts the hierarchical clustering idea. The neighboring nodes exchange the information and find out redundancy node in order to turn off their communications equipment. The simulation and analysis study demonstrate that the LICA not only provides the high quality of
Nan-nan Dong   +2 more
openaire   +1 more source

Some Preservation Results of Location Independent Riskier Order

2011
The preservations of location independent riskier order under certain monotone transformations are investigated. It is also showed that location independent riskier order can preserved formation of order statistics.
Bo-de Li, Jie Zhi
openaire   +1 more source

Location-independent adversarial patch generation for object detection

Journal of Electronic Imaging, 2023
Zhiyi Ding   +4 more
openaire   +1 more source

Location Independent Gesture Recognition Using Channel State Information

2022 IEEE 19th Annual Consumer Communications & Networking Conference (CCNC), 2022
Israel Elujide   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy