Results 231 to 240 of about 89,468 (247)

Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree

Adaptive Agents and Multi-Agent Systems
The Connected Budgeted maximum Coverage problem (CBC) is a combinatorial optimization problem that finds applications in path planning, wireless sensor networks, logistics, and bioinformatics. In CBC, we are given a collection of subsets S , defined over
Gianlorenzo D'angelo, Esmaeil Delfaraz
semanticscholar   +1 more source

Single-Document Summarization as a Tree Knapsack Problem

Conference on Empirical Methods in Natural Language Processing, 2013
Recent studies on extractive text summarization formulate it as a combinatorial optimization problem such as a Knapsack Problem, a Maximum Coverage Problem or a Budgeted Median Problem.
T. Hirao, Yasuhisa Yoshida, Masaaki Nishino, Norihito Yasuda, M. Nagata   +4 more
semanticscholar   +1 more source

Budgeted spatial data acquisition: when coverage and connectivity matter

Frontiers of Computer Science
Data is undoubtedly becoming a commodity like oil, land, and labour in the 21st century. Although there have been many successful marketplaces for data trading, the existing data marketplaces lack consideration of the case where buyers want to acquire a ...
Wenzhe Yang, Shixun Huang, Sheng Wang, Zhiyong Peng   +3 more
semanticscholar   +1 more source

Smart Eye: LLM-Guided Proposer-Verifier Framework for Industrial-Scale Log Anomaly Detection

Proceedings of the ACM Web Conference 2026
A practical log anomaly detection system for large-scale web services, suitable for real industrial deployment, should exhibit three key characteristics: fidelity to decisive lexical cues, human-auditable explanations, and low inference latency. Existing
Changhua Pei, Hang Cui, Jingjing Li, Yuxuan Li, Zihan Liu, Xinyuan Liao, Cenjie Hu, J. Wang, Zheyuan Li, Zexin Wang, Haotian Si, Ke Xiang, Gaogang Xie, Dan Pei   +13 more
semanticscholar   +1 more source

C-MASS: Combinatorial Mobility-Aware Sensor Scheduling for Collaborative Perception With Second-Order Topology Approximation

IEEE Transactions on Vehicular Technology
Collaborative Perception (CP) has been a promising solution to address occlusions in the traffic environment by sharing sensor data among collaborative vehicles (CoV) via vehicle-to-everything (V2X) network.
Yukuan Jia, Yuxuan Sun, Ruiqing Mao, Zhaojun Nan, Sheng Zhou, Zhisheng Niu   +5 more
semanticscholar   +1 more source

Lightweight Coordinated Sampling for Dynamic Flows under Budget Constraints

International Conference on Computer Communications and Networks
As cyber-attacks on networks become more stealthy, monitoring techniques relying on low-rate packet sampling may prove insufficient to detect attacks. While various sampling methods have been proposed to address capacity limitations and enhance detection
Mingming Chen, T. L. Porta, Trent Jaeger, S. Krishnamurthy   +3 more
semanticscholar   +1 more source

A Tabu Search Algorithm Based on Population Search Framework for Solving Multi-Budget Maximum Coverage Problem

2023
Yawen Liu, Dazhi Pan
openaire   +1 more source

Revisiting Wedge Sampling for Budgeted Maximum Inner Product Search

Lecture Notes in Computer Science, 2021
Ninh Pham
exaly  

Generalized budgeted submodular set function maximization

Information and Computation, 2021
Gianlorenzo D'Angelo, Gianpiero Monaco, Yllka Velaj   +2 more
exaly  

Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks

INFORMS journal on computing, 2006
Ramesh Bollapragada, Yanjun Li, U. Rao
semanticscholar   +1 more source