Results 41 to 50 of about 6,397 (149)
Finding the Median (Obliviously) with Bounded Space
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
Model‐based AI planning and execution platforms for robotics
Abstract Model‐based planning and execution systems offer a principled approach to building flexible autonomous robots that can perform diverse tasks by automatically combining a host of basic skills. This idea is almost as old as modern robotics. Yet, while diverse general‐purpose reasoning architectures have been proposed since, general‐purpose ...
Or Wertheim, Ronen I. Brafman
wiley +1 more source
Pebbling, Entropy and Branching Program Size Lower Bounds [PDF]
We contribute to the program of proving lower bounds on the size of branching programs solving the Tree Evaluation Problem introduced by Cook et. al. (2012).
Komarath, Balagopal, N, Jayalal Sarma M.
core +4 more sources
Abstract University Examination Timetabling Problem is the most important combinational problem to develop a conflict‐free timetable to execute all of the exams in and with the limited timeslots and other resources for universities, colleges or schools. It is also an important Nondeterministic Polynomial Time (NP)‐hard problem that has no deterministic
Abdul Ghaffar +3 more
wiley +1 more source
Abstract This study presents an intelligent system for predicting incident reports (IRs) in sectorized water distribution networks, such as drains in sidewalks, lack of pressure, lack of water, leaks, or others, based on pressure and flow data. Currently, incident detection in the industry is highly inefficient, as it is always performed reactively ...
Alicia Robles‐Velasco +3 more
wiley +1 more source
On finitely ambiguous B\"uchi automata
Unambiguous B\"uchi automata, i.e. B\"uchi automata allowing only one accepting run per word, are a useful restriction of B\"uchi automata that is well-suited for probabilistic model-checking.
A Arnold +14 more
core +1 more source
Macroevolutionary Patterns of Phytochemical Diversity in a Macaronesian Archipelago
ABSTRACT Aim Plant specialised metabolites are highly diverse and serve various functions, yet the different forms of phytochemical complexity and their drivers are often not fully understood. In this context, islands provide a valuable opportunity to explore the drivers of phytochemical diversity and its adaptive significance, owing to their unique ...
Xoaquín Moreira +14 more
wiley +1 more source
AI‐Driven TENGs for Self‐Powered Smart Sensors and Intelligent Devices
Triboelectric nanogenerators (TENGs) enable sustainable energy harvesting and self‐powered sensing but face challenges in material optimization, fabrication, and stability. Integrating artificial intelligence (AI) enhances TENG performance through machine learning, improving energy output, adaptability, and predictive maintenance.
Aiswarya Baburaj +4 more
wiley +1 more source
The Wadge Hierarchy of Deterministic Tree Languages
We provide a complete description of the Wadge hierarchy for deterministically recognisable sets of infinite trees. In particular we give an elementary procedure to decide if one deterministic tree language is continuously reducible to another.
Filip Murlak, Michele Bugliesi
core +1 more source
This paper uses a convex solution method based on integer linear programming to effectively plan the expansion of the distribution network, taking into account the availability of electric vehicle (EV) charging stations, compensators, substations, resources, and new lines. This paper aims to minimize the long‐term costs associated with the construction
Mahyar Abasi +2 more
wiley +1 more source

