172,082 Hits in 4.9 sec


Ronit Nath, Saptarshi Das, Shamik Sural, Jaideep Vaidya, Vijay Atluri
2019 Proceedings of the 24th ACM Symposium on Access Control Models and Technologies - SACMAT '19  
In the binary version (B-PolTree), at each node, a decision is taken based on whether a particular attribute-value pair is satisfied or not.  ...  In this paper, we introduce two variants of a tree data structure for representing ABAC policies, which we name as PolTree.  ...  We denote the obtained results using the average number of comparisons required to resolve an access for sequential search, modified sequential search, B-PolTree, and N-PolTree as C L ,C M , C B and C  ... 
doi:10.1145/3322431.3325102 pmid:31346589 pmcid:PMC6658170 dblp:conf/sacmat/NathDSVA19 fatcat:2gkfi2dxgvd3xijlh5plf3eise

Improving Auto-Augment via Augmentation-Wise Weight Sharing [article]

Keyu Tian, Chen Lin, Ming Sun, Luping Zhou, Junjie Yan, Wanli Ouyang
2020 arXiv   pre-print
The recent progress on automatically searching augmentation policies has boosted the performance substantially for various tasks.  ...  The augmentation policies found by our method achieve superior accuracies compared with existing auto-augmentation search methods.  ...  AA [41] , even though we, unlike [41] , do not use the Sample Pairing [14] for search. Consistent observations are found on the results on CIFAR-100 in Tab. 2.  ... 
arXiv:2009.14737v2 fatcat:uxhpy3uxqzhmplqysvn2ieuhca

Minimization of open orders: application of a re-distribution coordination policy

Alexandre Linhares
2004 International Journal of Production Research  
This is done with the use of a coordination policy which enables the processes with greatest performance to act as 'attractors' to those processes trapped in areas of worse perceived potential.  ...  A new asynchronous collective search model is proposed, exploring the search space in a manner that concentrates effort onto those areas of higher perceived potential.  ...  the use of the re-distribution coordination policy.  ... 
doi:10.1080/00207540310001622421 fatcat:yghq5ipwtzffphezblvunlsaam

Energy-aware relay selection for multiuser relay networks

Fangzhi Zuo, Min Dong
2012 2012 IEEE International Conference on Communications (ICC)  
We propose a priority search algorithm which is shown to provide the optimal solution with linear complexity in the number of relays.  ...  We consider a dual-hop relay network with multiple source-destination (S-D) pairs and multiple relays, where amplify-and-forward relaying strategy is applied and transmission among S-D pairs takes place  ...  We use priority round-robin as the bench mark comparison, where each S-D pair in turn to have the highest priority to select a relay.  ... 
doi:10.1109/icc.2012.6364614 dblp:conf/icc/ZuoD12 fatcat:7facjjxg7jc2homsbky7c6poeq

Subgraph Matching via Query-Conditioned Subgraph Matching Neural Networks and Bi-Level Tree Search [article]

Yunsheng Bai, Derek Xu, Yizhou Sun, Wei Wang
2022 arXiv   pre-print
state; (2) A Monte Carlo Tree Search enhanced bi-level search framework for training the policy and value networks.  ...  Recent advances have shown the success of using reinforcement learning and search to solve NP-hard graph-related tasks, such as Traveling Salesman Optimization, Graph Edit Distance computation, etc.  ...  a new node pair to match, and the inner level is the MCTS, which allows revisiting states and providing an improved search policy π used for training P θ (a t |s t ).  ... 
arXiv:2207.10305v1 fatcat:zip77zrwsngvxm46uypga45yt4

Estimating interleaved comparison outcomes from historical click data

Katja Hofmann, Shimon Whiteson, Maarten de Rijke
2012 Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12  
We investigate the use of previously collected click data (i.e., historical data) for interleaved comparisons.  ...  We experimentally confirm that probabilistic methods make the use of historical data for interleaved comparisons possible and effective.  ...  This research was partially supported by the European Union's ICT Policy Support Programme as part of the  ... 
doi:10.1145/2396761.2398516 dblp:conf/cikm/HofmannWR12 fatcat:aaokjqydcbb4zmhcri7bwvjxwy

Review on Key-Aggregate Searchable Encryption (KASE) for Group Data Sharing

R. Rakesh, Anoop S.
2016 International Journal of Computer Applications  
A detailed review of various methods used for data access controls and encryption is presented and a brief comparison among the discussed methods is given.  ...  Comparison of various methodologies is done and performed pairing computation analysis on system and mobile phone.  ...  Generally, here documents is encrypted by a key pair, this obtained key pair is changed into single aggregate key by using data owner public key and master secret key.  ... 
doi:10.5120/ijca2016909101 fatcat:37iwvmpzibeh5oyu7pemfq4w5m

APQ: Joint Search for Network Architecture, Pruning and Quantization Policy [article]

Tianzhe Wang, Kuan Wang, Han Cai, Ji Lin, Zhijian Liu, Song Han
2020 arXiv   pre-print
Unlike previous methods that separately search the neural architecture, pruning policy, and quantization policy, we optimize them in a joint manner.  ...  However, training this quantization-aware accuracy predictor requires collecting a large number of quantized pairs, which involves quantization-aware finetuning and thus is highly time-consuming.  ...  We use the same test set with 2000 NN architecture, ImageNet accuracy pairs that are generated by randomly choosing network architecture and quantization policy.  ... 
arXiv:2006.08509v1 fatcat:kc7qbcokpfap7lt6y6li2fnale

Finding Online Extremists in Social Networks [article]

Jytte Klausen, Christopher Marks, Tauhid Zaman
2016 arXiv   pre-print
We find a simple characterization of the optimal search policy for this model under fairly general conditions.  ...  Our urn model and main theoretical results generalize easily to search problems in other fields.  ...  This policy randomly chooses a query from those that are possible at each stage. Comparison of Expected Costs We computed the expected cost for each policy using equation (7) .  ... 
arXiv:1610.06242v1 fatcat:mx7segdoazfstjk576jtb4rny4

Learning rewards for robotic ultrasound scanning using probabilistic temporal ranking [article]

Michael Burke, Katie Lu, Daniel Angelov, Artūras Straižys, Craig Innes, Kartic Subr, Subramanian Ramamoorthy
2020 arXiv   pre-print
As an example, this work considers the problem of ultrasound scanning, where a demonstration involves an expert adaptively searching for a satisfactory view of internal organs, vessels or tissue and potential  ...  pairs Z t1 , Z t2 from each demonstration sequence, which produce a comparison outcome g = 1 if t 2 > t 1 , and g = 0 if t 1 > t 2 .  ...  imaging applications and safety concerns limit online policy search here.  ... 
arXiv:2002.01240v2 fatcat:go36csqb5zfq3loa4eqoftffnq

Policy Learning for Malaria Control [article]

Van Bach Nguyen, Belaid Mohamed Karim, Bao Long Vu, Jörg Schlötterer, Michael Granitzer
2019 arXiv   pre-print
We evaluate those algorithms and compare their performance with Random Search as a baseline.  ...  We apply the Genetic Algorithm, Bayesian Optimization, Q-learning with sequence breaking to find the optimal policy for five years in a row with only 20 episodes/100 evaluations.  ...  Random Search (2 years) 35 100% 105 100% BO.3: Boosting Network 70 200% 210 140% Algorithms Average rewards Env. 1 Env. 2 Table 3 : 3 Comparison between algorithms Random Search (Baseline) 161.20  ... 
arXiv:1910.08926v1 fatcat:43svnlhhyfaj5opuqm4siqqiwy

A Lightweight Fine-Grained Search Scheme over Encrypted Data in Cloud-Assisted Wireless Body Area Networks

Mingsheng Cao, Luhan Wang, Zhiguang Qin, Chunwei Lou
2019 Wireless Communications and Mobile Computing  
To resolve these issues, in this paper, we propose a lightweight fine-grained search over encrypted data in WBANs by employing ciphertext policy attribute based encryption and searchable encryption technologies  ...  These data can be used to analyze and diagnose to improve the healthcare quality of patients.  ...  The encryption time comparison, search time comparison, and decryption time comparison are given, respectively, in Figures 3(d) , 3(e) , and 3(f).  ... 
doi:10.1155/2019/9340808 fatcat:p6x7if5n7rd3te3c5vlfrzflj4

Policy-driven automated reconfiguration for performance management in WDM optical networks

W. Golab, R. Boutaba
2004 IEEE Communications Magazine  
This survey paper is concerned with the problem of automatically updating the configuration of an optical network to accommodate changes in traffic demand, which entails making a reconfiguration policy  ...  A comparison is presented in [2] of optimal policies obtained using the Markov decision process formulation, against much simpler policies based on two thresholds.  ...  In comparison, partial reconfiguration and local search approaches, both of which are also based on heuristics, achieve slightly worse results.  ... 
doi:10.1109/mcom.2004.1262161 fatcat:zpltv2q3lrdcnh6wzy53ewzlh4

High Quality Related Search Query Suggestions using Deep Reinforcement Learning [article]

Praveen Kumar Bodigutla
2021 arXiv   pre-print
Reinforcement Learning techniques employed to reformulate a query using terms from search results, have limited scalability to large-scale industry applications.  ...  "High Quality Related Search Query Suggestions" task aims at recommending search queries which are real, accurate, diverse, relevant and engaging.  ...  In the pretraining step, we train the supervised 2 model using co-occurring consecutive query pairs in a search sessions.  ... 
arXiv:2108.04452v1 fatcat:74aut3i7kre35av3cdelg5eglq

A Novel Class of Scheduling Policies for the Stochastic Resource-Constrained Project Scheduling Problem

Behzad Ashtiani, Roel Leus, Mir-Bahador Aryanezhad
2008 Social Science Research Network  
We introduce a new class of scheduling policies for this problem, which make a number of a-priori sequencing decisions in a pre-processing phase, while the remaining decisions are made dynamically during  ...  We compare the performance of this new class with existing scheduling policies for the stochastic resource-constrained project scheduling problem, and we observe that the new class is significantly better  ...  Phase 2: a local-search procedure for activity pairs Contrary to the search procedure for activity lists, the local search for activity pairs is one of the novelties in this paper.  ... 
doi:10.2139/ssrn.1368714 fatcat:5vcuajfvsbea7mweyquqw3w6am
« Previous Showing results 1 — 15 out of 172,082 results