Results 11 to 20 of about 24,103 (206)
Sticky Seeding in Discrete-Time Reversible-Threshold Networks [PDF]
, 2016 When nodes can repeatedly update their behavior (as in agent-based models from computational social science or repeated-game play settings) the problem of optimal network seeding becomes very complex.
Spencer, Gwen
core +3 more sources
A Constant Approximation for Colorful k-Center [PDF]
, 2019 In this paper, we consider the colorful k-center problem, which is a generalization of the well-known k-center problem. Here, we are given red and blue points in a metric space, and a coverage requirement for each color.
Bandyapadhyay, Sayan +3 more
core +2 more sources
The Non-Uniform k-Center Problem [PDF]
, 2016 In this paper, we introduce and study the Non-Uniform k-Center problem (NUkC). Given a finite metric space $(X,d)$ and a collection of balls of radii $\{r_1\geq \cdots \ge r_k\}$, the NUkC problem is to find a placement of their centers on the metric ...
Chakrabarty, Deeparnab +2 more
core +2 more sources
Trading Safety Versus Performance: Rapid Deployment of Robotic Swarms with Robust Performance Constraints [PDF]
, 2015 In this paper we consider a stochastic deployment problem, where a robotic swarm is tasked with the objective of positioning at least one robot at each of a set of pre-assigned targets while meeting a temporal deadline. Travel times and failure rates are
Carpin, Stefano +3 more
core +2 more sources
Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design
, 2016 We study a type of reverse (procurement) auction problems in the presence of budget constraints. The general algorithmic problem is to purchase a set of resources, which come at a cost, so as not to exceed a given budget and at the same time maximize a ...
AA Ageev +6 more
core +1 more source
On Budget-Feasible Mechanism Design for Symmetric Submodular Objectives
, 2017 We study a class of procurement auctions with a budget constraint, where an auctioneer is interested in buying resources or services from a set of agents.
A Borodin +19 more
core +1 more source
Online Budgeted Maximum Coverage [PDF]
, 2016 We study the Online Budgeted Maximum Coverage (OBMC) problem. Subsets of a weighted ground set U arrive one by one, where each set has a cost. The online algorithm has to select a collection of sets, under the constraint that their cost is at most a ...
Rawitz, Dror
core +1 more source
Multi‐Scale Interface Engineering of MXenes for Multifunctional Sensory Systems
Advanced Functional Materials, EarlyView.MXenes, as two‐dimensional transition metal carbides and nitrides, demonstrate remarkable capabilities for multifunctional sensing applications. This review systematically examines multi‐scale interface engineering approaches that enhance sensing performance, enable diverse detection functionalities, and improve system‐level compatibility in MXene ...
Jiaying Liao, Sin‐Yi Pang, Jianhua Hao
wiley +1 more source
Atomic Layer Deposition in Transistors and Monolithic 3D Integration
Advanced Functional Materials, EarlyView.Transistors are fundamental building blocks of modern electronics. This review summarizes recent progress in atomic layer deposition (ALD) for the synthesis of two‐dimensional (2D) metal oxides and transition‐metal dichalcogenides (TMDCs), with particular emphasis on their enabling role in monolithic three‐dimensional (M3D) integration for next ...
Yue Liu +5 more
wiley +1 more source
Advanced Functional Materials, EarlyView.Flexible piezoresistive pressure sensors underpin wearable and soft electronics. This review links sensing physics, including contact resistance modulation, quantum tunneling and percolation, to unified materials/structure design. We highlight composite and graded architectures, interfacial/porous engineering, and microstructured 3D conductive networks
Feng Luo +2 more
wiley +1 more source