Search Results for author:
Found 17 papers, 6 papers with code
Guidance Graph Optimization for Lifelong Multi-Agent Path Finding
Empirically, we show that (1) our guidance graphs improve the throughput of three representative lifelong MAPF algorithms in four benchmark maps, and (2) our update model can generate guidance graphs for as large as $93 \times 91$ maps and as many as 3000 agents.
An Empirical Study on Google Research Football Multi-agent Scenarios
Few multi-agent reinforcement learning (MARL) research on Google Research Football (GRF) focus on the 11v11 multi-agent full-game scenario and to the best of our knowledge, no open benchmark on this scenario has been released to the public.
Metropolis Theorem and Its Applications in Single Image Detail Enhancement
Traditional image detail enhancement is local filter-based or global filter-based.
Ontology-aware Network for Zero-shot Sketch-based Image Retrieval
Zero-Shot Sketch-Based Image Retrieval (ZSSBIR) is an emerging task.
Deep Forest with Hashing Screening and Window Screening
To screen out redundant feature vectors, we introduce a hashing screening mechanism for multi-grained scanning and propose a model called HW-Forest which adopts two strategies, hashing screening and window screening.
A Survey on Long-Tailed Visual Recognition
Data quality directly dominates the effect of deep learning models, and the long-tailed distribution is one of the factors affecting data quality.
Learning to Contextually Aggregate Multi-Source Supervision for Sequence Labeling
Its performance is largely influenced by the annotation quality and quantity in supervised learning scenarios, and obtaining ground truth labels is often costly.
Recurrent Event Network : Global Structure Inference Over Temporal Knowledge Graph
We present Recurrent Event Network (RE-Net), a novel autoregressive architecture for modeling temporal sequences of multi-relational graphs (e. g., temporal knowledge graph), which can perform sequential, global structure inference over future time stamps to predict new events.
Eliciting Knowledge from Experts: Automatic Transcript Parsing for Cognitive Task Analysis
To reduce human efforts and scale the process, automated CTA transcript parsing is desirable.
Eliciting Knowledge from Experts:Automatic Transcript Parsing for Cognitive Task Analysis
To reduce human efforts and scale the process, automated CTA transcript parsing is desirable.
Combating Fake News: A Survey on Identification and Mitigation Techniques
The proliferation of fake news on social media has opened up new directions of research for timely identification and containment of fake news, and mitigation of its widespread impact on public opinion.
Topkapi: Parallel and Fast Sketches for Finding Top-K Frequent Elements
In particular, for identifying top-K frequent items, Count-Min Sketch (CMS) has fantastic update time but lack the important property of reducibility which is needed for exploiting available massive data parallelism.
Deep Learning in Software Engineering
To answer these questions, we conduct a bibliography analysis on 98 research papers in SE that use deep learning techniques.
Software Engineering
Approximating the Backbone in the Weighted Maximum Satisfiability Problem
And then we presented a backbone guided local search (BGLS) with Walksat operator for weighted MAX-SAT.
A Hybrid ACO Algorithm for the Next Release Problem
In this paper, we propose a Hybrid Ant Colony Optimization algorithm (HACO) for Next Release Problem (NRP).
Approximate Muscle Guided Beam Search for Three-Index Assignment Problem
In this paper, a new heuristic named Approximate Muscle guided Beam Search (AMBS) is developed to achieve a good trade-off between solution quality and running time.
Group Regularized Estimation under Structural Hierarchy
We give the minimax lower bounds for strong and weak hierarchical variable selection and show that the proposed estimators enjoy sharp rate oracle inequalities.
