scholarly journals Experimental Analysis of Endogenous Institutional Choice: Constantly Revealing Versus Ad-Hoc Contracting

2021 ◽  
Author(s):  
Daniela Teresa di Cagno ◽  
Lorenzo Ferrari ◽  
Werner Güth ◽  
Vittorio Larocca
Keyword(s):  
Experimental Analysis ◽  
Ad Hoc ◽  
Institutional Choice

scholarly journals Experimental Analysis of UDP Performance in Mobile Ad Hoc Networks with Different Routing Protocols and varying payload

2011 ◽  
Vol 2 (6) ◽  
pp. 107-113
Author(s):  
Bikash Chandra Singh ◽  
Tapan Kumar Godder ◽  
Md. Sipon Miah ◽  
H. M Abdul Awal
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Experimental Analysis ◽  
Ad Hoc ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Experimental Analysis of UWB OFDM Software-Defined Radar Performance for Ad-Hoc Networked Systems

2018 ◽  
Author(s):  
Nahlah Condict ◽  
Dmitriy Garmatyuk ◽  
Saba Mudaliar
Keyword(s):  
Experimental Analysis ◽  
Ad Hoc ◽  
Networked Systems

scholarly journals Partial Compilation of ASP Programs

2019 ◽  
Vol 19 (5-6) ◽  
pp. 857-873 ◽  
Author(s):  
BERNARDO CUTERI ◽  
CARMINE DODARO ◽  
FRANCESCO RICCA ◽  
PETER SCHÜLLER
Keyword(s):  
Experimental Analysis ◽  
Ad Hoc ◽  
Blow Up ◽  
State Of The Art ◽  
Answer Set Programming ◽  
General Purpose ◽  
Combinatorial Problems ◽  
New Approach ◽  
Input Program ◽  
Evaluation Algorithm

AbstractAnswer Set Programming (ASP) is a well-known declarative formalism in logic programming. Efficient implementations made it possible to apply ASP in many scenarios, ranging from deductive databases applications to the solution of hard combinatorial problems. State-of-the-art ASP systems are based on the traditional ground&solve approach and are general-purpose implementations, i.e., they are essentially built once for any kind of input program. In this paper, we propose an extended architecture for ASP systems, in which parts of the input program are compiled into an ad-hoc evaluation algorithm (i.e., we obtain a specific binary for a given program), and might not be subject to the grounding step. To this end, we identify a condition that allows the compilation of a sub-program, and present the related partial compilation technique. Importantly, we have implemented the new approach on top of a well-known ASP solver and conducted an experimental analysis on publicly-available benchmarks. Results show that our compilation-based approach improves on the state of the art in various scenarios, including cases in which the input program is stratified or the grounding blow-up makes the evaluation unpractical with traditional ASP systems.

Experimental Analysis of Channel Interference in Ad Hoc Network

2014 ◽  
Vol 4 (1) ◽  
pp. 197-203
Author(s):  
Anup Bhola ◽  
Uma Sharma ◽  
CK Jha
Keyword(s):  
Experimental Analysis ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Channel Interference

scholarly journals Experimental Analysis of OLSR and DSDV Protocols on NS-2.35 in Mobile Ad-Hoc Networks

2015 ◽  
Vol 7 (8) ◽  
pp. 21-29 ◽  
Author(s):  
Shelja Sharma ◽  
◽  
Suresh Kumar Bhardwaj
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Experimental Analysis ◽  
Ad Hoc ◽  
Mobile Ad Hoc ◽  
Hoc Networks

scholarly journals Experimental Analysis of Distributed Routing Algorithms in Ad Hoc Mobile Networks

2015 ◽  
Vol 57 ◽  
pp. 1411-1416 ◽  
Author(s):  
Jaswinder Singh ◽  
Manish Bhardwaj ◽  
Abhishek Sharma
Keyword(s):  
Mobile Networks ◽  
Experimental Analysis ◽  
Ad Hoc ◽  
Routing Algorithms ◽  
Distributed Routing ◽  
Ad Hoc Mobile Networks
Sign in / Sign up

Export Citation Format

Share Document