76 Hits in 2.1 sec

Finding Optimal Solutions to Atomix [chapter]

Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier
2001 Lecture Notes in Computer Science  
doi:10.1007/3-540-45422-5_17 fatcat:w6sxgnmuw5glvetagunn7lnbyi

Atomix: A Framework for Deploying Signal Processing Applications on Wireless Infrastructure

Manu Bansal, Aaron Schulman, Sachin Katti
2015 Symposium on Networked Systems Design and Implementation  
We also demonstrate that the modular structure of software built with Atomix makes it easy for programmers to deploy new signal processing applications.  ...  This makes it challenging to build modular applications. We present Atomix, a modular software framework for building applications on wireless infrastructure.  ...  Then, finding the optimal schedule for a flowgraph can be expressed as a resource assignment problem with dependency constraints.  ... 
dblp:conf/nsdi/BansalSK15 fatcat:zshzl2jezjhurne6ogjzkpiuo4

The Parameterized Complexity of Ricochet Robots

Adam Hesterberg, Justin Kopinsky
2017 Journal of Information Processing  
In general, finding an optimal solution to these puzzles is known to be PSPACE-complete.  ...  Sliding maze puzzles like Ricochet Robots and Atomix are puzzles in which solvers must maneuver agents around a grid board subject to the constraint that whenever an agent moves in some direction, it must  ...  There is one other equally good solution on this board, finding which is left as an optional exercise to the reader.  ... 
doi:10.2197/ipsjjip.25.716 fatcat:7vww5jxu3ncjphwd36hlvbp4hu

Benchmarking Explicit State Parallel Model Checkers

Mike Jones, Eric G. Mercer, Tonglaga Bao, Rahul Kumar, Peter Lamborn
2003 Electronical Notes in Theoretical Computer Science  
Empirical results show that load balancing becomes an issue for more than 32 workstations in the partition algorithm and that random walk is a reasonable, low overhead, approach for finding errors in large  ...  The benchmarks and metrics are used to compare two parallel model checking algorithms: partition and random walk.  ...  This can be understood as the time measured on a clock on the wall from when the problem begins to when the solution is complete.  ... 
doi:10.1016/s1571-0661(05)80098-2 fatcat:dn6eglclzvd27ea3fgseysny4a

Software-defined Radios: Architecture, State-of-the-art, and Challenges [article]

Rami Akeela, Behnam Dezfouli
2018 arXiv   pre-print
We also review existing SDR platforms and present an analytical comparison as a guide to developers. Finally, we recognize a few of the related research topics and summarize potential solutions.  ...  SDR designers intend to simplify the realization of communication protocols while enabling researchers to experiment with prototypes on deployed networks.  ...  Finding the optimal design partition is not trivial.  ... 
arXiv:1804.06564v1 fatcat:ogkut4aibnfarbrvjkihdfiqnu

A Survey Of Software Radios: Reconfigurable Platforms, Development Tools And Future Directions

Hassan Nasser, Damascus University, Abdelrazak Badawieh, Abdulkarim Assalem, Damascus University, Al-Baath University
2020 Radioelectronics Nanosystems Information Technologies  
Using Airblue, developers may find the need to modify the building blocks, or modules, to add new features, make algorithmic modifications, and tune the performance to meet throughput or timing requirements  ...  , or make FPGAspecific optimizations.  ... 
doi:10.17725/rensit.2020.12.207 fatcat:w5aqf5xrjvf7vh5eyk472gmk7i

OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding

Eleftherios Kokoris-Kogias, Philipp Jovanovic, Linus Gasser, Nicolas Gailly, Ewa Syta, Bryan Ford
2018 2018 IEEE Symposium on Security and Privacy (SP)  
Most existing distributed ledgers are unable to scale-out, i.e., to grow their total processing capacity with the number of validators; and those that do, compromise security or decentralization.  ...  OmniLedger also optimizes performance via parallel intra-shard transaction processing, ledger pruning via collectively-signed state blocks, and low-latency "trust-butverify" validation for low-value transactions  ...  Client-Perceived End-to-End Latency with Atomix In this experiment we evaluate in different shard configurations, the client-perceived, end-to-end latency when using Atomix.  ... 
doi:10.1109/sp.2018.000-5 dblp:conf/sp/Kokoris-KogiasJ18 fatcat:ssh5gij6mzhbpkr5fukyfdqcwu

Load Balancing Parallel Explicit State Model Checking

Rahul Kumar, Eric G. Mercer
2005 Electronical Notes in Theoretical Computer Science  
is the problem that the load balancing methods presented in Chapter 5 will provide solutions to.  ...  This can be understood as the time measured on a clock on the wall from when the problem begins to when the solution is complete.  ...  To avoid this, a block of memory is allocated on each processor to function as a state cache. Only states not present in the cache are forwarded to their owning processors.  ... 
doi:10.1016/j.entcs.2004.10.016 fatcat:g4ggowcjazhsvoeldb3ijfojse

Domain-Dependent Heuristics and Tie-Breakers: Topics in Automated Planning

Augusto B. Corrêa, André G. Pereira, Marcus Ritt
2018 Revista de Iniciação Científica  
Given an initial state, a goal and a set of operators, we want to find a sequence of operators leading us to the goal.  ...  We propose a new tie-breaking method that is proved to be the best possible and also show that our methods solve more instances than previous methods in literature  ...  Notice that optimal expansion does not imply that A * finds a shortest cost-optimal solution, since the shortest path is guaranteed only for the final f -layer.  ... 
doi:10.5753/reic.2018.1057 fatcat:7ilvkh2diva6rnthjyo2k4eu7m

Implementation Aspects of Smart Grids Cyber-Security Cross-Layered Framework for Critical Infrastructure Operation

Dennis Agnew, Nader Aljohani, Reynold Mathieu, Sharon Boamah, Keerthiraj Nagaraj, Janise McNair, Arturo Bretas
2022 Applied Sciences  
According to the findings of our suggested architecture, it outperforms a single SDN controller framework by a factor of more than ten times the throughput.  ...  The system is constructed in Mininet to simulate a communication network and obtain data for analysis.  ...  ONOS also allows for quick redistribution of controller load, allowing each controller to function optimally for the network.  ... 
doi:10.3390/app12146868 fatcat:m453unyuwvbvnjtcuwmpqe4vhi

Survey: Sharding in Blockchains

Guangsheng Yu, Xu Wang, Kan Yu, Wei Ni, J. Andrew Zhang, Ren Ping Liu
2020 IEEE Access  
In regards to this issue, a number of solutions have been proposed, targeting to boost the scalability while preserving the decentralization and security.  ...  We provide detailed comparison and quantitative evaluation of major sharding mechanisms, along with our insights analyzing the features and restrictions of the existing solutions.  ...  UCOT Australia is a full-industry chain anti-counterfeiting traceability solution operator, dedicated to research and development of technology products based on Blockchain.  ... 
doi:10.1109/access.2020.2965147 fatcat:vtvhdid44vckfao3qpgfuvjbn4

Containerized Services Orchestration for Edge Computing in Software-defined Wide Area Networks

Felipe Rodriguez Yaguache, Kimmo Ahola
2019 International Journal of Computer Networks & Communications  
Also, the implementation's performance is tested based on the required times for updating the discovery solution according to service updates.  ...  solution.  ...  Edge computing has arisen as a new approach that alongside SDN could be able to offer a solution to network optimization in cloud environments.  ... 
doi:10.5121/ijcnc.2019.11507 fatcat:dij2qdibcrfsjjgurcvhirlmc4

Optimal Shelf Arrangement to Minimize Robot Retrieval Time [article]

Lawrence Yunliang Chen, Huang Huang, Michael Danielczuk, Jeffrey Ichnowski, Ken Goldberg
2022 arXiv   pre-print
We propose OSA-MIP, a mixed-integer program (MIP), show that it finds an optimal solution for OSA under certain conditions, and provide bounds on its suboptimal solutions in general cost settings.  ...  We formulate the problem of Optimal Shelf Arrangement (OSA), where the goal is to optimize the arrangement of objects on a shelf for access time given an access frequency and movement cost for each object  ...  We bypass this nested optimization and propose OSA-MIP, a mixedinteger program (MIP) that finds a near-optimal solution to the OSA problem.  ... 
arXiv:2206.08607v1 fatcat:2edq4veehfhfdcjzl67ggaffue

Theory and Practice of Time-Space Trade-Offs in Memory Limited Search [chapter]

Stefan Edelkamp, Ulrich Meyer
2001 Lecture Notes in Computer Science  
Having to cope with memory limitations is an ubiquitous issue in heuristic search.  ...  We present theoretical and practical results on new variants for exploring state-space with respect to memory limitations.  ...  The authors would like to thank Robert Holte for valuable discussions and comments and Alberto Lluch Lafuente for the joined implementation efforts in the HSF-SPIN protocol validator.  ... 
doi:10.1007/3-540-45422-5_13 fatcat:qgu2gp3xqzbanae34w4eu46q3a

A Comparative and Analytical Study for Choosing the Best Suited SDN Network Operating System for Cloud Data Center

Maiass Zaher, Sándor Molnár
2022 Annals of Emerging Technologies in Computing  
scalability, ease of use, maturity, security and interoperability, and functional features, such as virtualization, fault verification and troubleshooting, packet forwarding techniques and traffic protection solutions  ...  This study aims to determine the best NOS according to the requirements of Cloud Data Center (CDC). This paper evaluates the specifications of the most common open-source NOSs.  ...  Finally, all remaining criteria have similar weights except Virtualization since we aim to find the optimal NOS for CDC.  ... 
doi:10.33166/aetic.2022.01.003 fatcat:x4xs7sfta5dx7iicdhuzjwxxqa
« Previous Showing results 1 — 15 out of 76 results