Results 71 to 80 of about 21,948 (228)
ETRI Journal, 2022 This paper focuses on a mobile edge-computing-enabled heterogeneous network. A battery level-aware task-scheduling framework is proposed to improve the energy efficiency and prolong the operating hours of batterypowered mobile devices.
Zhigang Xie +3 more
doaj +1 more source
Finding the Median (Obliviously) with Bounded Space
, 2015 We prove that any oblivious algorithm using space $S$ to find the median of a list of $n$ integers from $\{1,...,2n\}$ requires time $\Omega(n \log\log_S n)$. This bound also applies to the problem of determining whether the median is odd or even.
A Borodin +15 more
core +1 more source
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages [PDF]
, 2007 The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the
Glasser, Christian +2 more
core +7 more sources
An algorithm for weak synthesis observation equivalence for compositional supervisor synthesis [PDF]
, 2012 This paper proposes an algorithm to simplify automata in such a way that compositional synthesis results are preserved in every possible context. It relaxes some requirements of synthesis observation equivalence from previous work, so that better ...
Fabian, Martin +2 more
core +2 more sources
New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique
Journal of Combinatorial Designs, Volume 34, Issue 1, Page 37-50, January 2026.ABSTRACT We provide some difference triangle sets with scopes that improve upon the best known values. These are found with purpose‐built digital circuits realized with field‐programmable gate arrays (FPGAs) rather than software algorithms running on general‐purpose processors.
Mohannad Shehadeh +2 more
wiley +1 more source
A Tighter Bound for the Determinization of Visibly Pushdown Automata
, 2009 Visibly pushdown automata (VPA), introduced by Alur and Madhusuan in 2004, is a subclass of pushdown automata whose stack behavior is completely determined by the input symbol according to a fixed partition of the input alphabet.
Van Tang, Nguyen
core +2 more sources
Approximating the Termination Value of One-Counter MDPs and Stochastic Games [PDF]
, 2011 One-counter MDPs (OC-MDPs) and one-counter simple stochastic games (OC-SSGs) are 1-player, and 2-player turn-based zero-sum, stochastic games played on the transition graph of classic one-counter automata (equivalently, pushdown automata with a 1-letter ...
G.R. Grimmett +6 more
core +3 more sources
FTheoryTools: Advancing Computational Capabilities for F‐Theory Research
Fortschritte der Physik, Volume 74, Issue 1, January 2026.Abstract A primary goal of string phenomenology is to identify realistic four‐dimensional physics within the landscape of string theory solutions. In F‐theory, such solutions are encoded in the geometry of singular elliptic fibrations, whose study often requires particularly challenging and cumbersome computations.
Martin Bies +2 more
wiley +1 more source
A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles
Abstract and Applied Analysis, 2014 The packing problem of unit equilateral triangles not only has the theoretical significance but also offers broad prospects in material processing and network resource optimization.
Ruimin Wang +3 more
doaj +1 more source
Which Classes of Origin Graphs Are Generated by Transducers. [PDF]
, 2017 We study various models of transducers equipped with origin information. We consider the semantics of these models as particular graphs, called origin graphs, and we characterise the families of such graphs recognised by streaming string ...
Bojanczyk, M. +3 more
core +2 more sources