Instant search in which a system finds answers to a query instantly using character by character. When the user can search the query then fuzzy search improves to finding relevant answers. In this fuzzy the user can get answers within milliseconds by each query with high throughput. ...
The algorithm presented in this paper describes an interactive approach for generating search directions in multiobjective linear programming problems (MOLP). The approach is based on using the AHP to assign priorities to vertices adjacent to those that are in the basis, as generated by the simplex...
Semantic ranking of web pages based on formal concept analysis A web crawler is an important research component in a search engine. In this paper, a new method for measuring the similarity of formal concept analysis (F... YJ Du,YF Hai - 《Journal of Systems & Software》 被引量: 46发表...
An integrated case-based reasoning approach for personalized itinerary search in multimodal transportation systems Suggesting personalized itinerary search for travelers in a multimodal transportation system is a challenging problem. This is due to the increased complex... A Bouhana,A Fekih,M Abed,......
The algorithm uses a priority based mechanism, inspired by use of dispatching rules, to effectively guide the search towards Pareto optimal points for a multi-objective IPPS problem. An external archive is used to store the non-dominated solutions. The proposed algorithm has been tested for three...
The search period was 2003–2021, and 904 studies were extracted. 2.2. Analytical methods This study used a combination of quantitative and qualitative methods and focused on the use of quantitative methods. Graphs and scientific knowledge maps of literature data were created based on a manual ...
Semantic Scholar dx.doi.org ResearchGate koreascience.or.kr papersearch.net 查看更多 相似文献 参考文献 引证文献Multi-channel MAC protocol for wireless sensor networks: A schedule-based approach Limited bandwidth remains a pressing issue for wireless sensor networks (WSNs) due to the half-duplex prope...
Adaptive compilation is a relatively new technique that uses repeated compilation and search to find effective parameters for compiler optimizations. We examine the priority-based graph-coloring register-allocation algorithm in the context of an adaptive compiler. The priority-based algorithm was selected ...
So how do we find the implementation? The ecall.cpp C++ file (which is located at \clr\vm\ecall.cpp in the SSCLI) contains a table that maps managed internal call methods to unmanaged C++ implementations. Search ecall.cpp for "CompleteGuid" and you'll find the following code: ...
Further, the energy and latency minimization problem is solved using an exhaustive search to validate the performance of the RL algorithm. We compare the performance of RL-based approach with non-RL-based approaches such as max-queue based and random node based cluster-head selection [27]. Some...