:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Quenard, Gaspard, Pellier, Damier, Fiorino, Humbert
Format:	Preprint
Published:	2024
Subjects:	Artificial Intelligence
Online Access:	https://arxiv.org/abs/2411.02035
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Beacon Based Solution for Autonomous UUVs GNSS-Denied Stealthy Navigation
by: Albore, Alexandre, et al.
Published: (2026)

Human-Cobot collaboration's impact on success, time completion, errors, workload, gestures and acceptability during an assembly task
by: Fournier, Étienne, et al.
Published: (2024)

Sibyl: Simple yet Effective Agent Framework for Complex Real-world Reasoning
by: Wang, Yulong, et al.
Published: (2024)

Less Greedy Equivalence Search
by: Ejaz, Adiba, et al.
Published: (2025)

SibylSense: Adaptive Rubric Learning via Memory Tuning and Adversarial Probing
by: Xu, Yifei, et al.
Published: (2026)

Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis
by: Ye, Furong, et al.
Published: (2024)

Extracting Problem Structure with LLMs for Optimized SAT Local Search
by: Schidler, André, et al.
Published: (2025)

Using Sequential Runtime Distributions for the Parallel Speedup Prediction of SAT Local Search
by: Arbelaez, Alejandro, et al.
Published: (2024)

Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
by: Shimoda, Takumi, et al.
Published: (2024)

SAT Requires Exhaustive Search
by: Xu, Ke, et al.
Published: (2023)

Sibyl-AutoResearch: Autonomous Research Needs Self-Evolving Trial-and-Error Harnesses, Not Paper Generators
by: Wang, Chengcheng, et al.
Published: (2026)

Enhancing Local Search for MaxSAT with Deep Differentiation Clause Weighting
by: Jiang, Menghua, et al.
Published: (2025)

FootstepNet: an Efficient Actor-Critic Method for Fast On-line Bipedal Footstep Planning and Forecasting
by: Gaspard, Clément, et al.
Published: (2024)

Greedy Perspectives: Multi-Drone View Planning for Collaborative Perception in Cluttered Environments
by: Suresh, Krishna, et al.
Published: (2023)

Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers
by: Zheng, Jiongzhi, et al.
Published: (2024)

AutoSAT: Automatically Optimize SAT Solvers via Large Language Models
by: Sun, Yiwen, et al.
Published: (2024)

Plan Before Search: Search Agents Need Plan
by: Qian, Zhipeng, et al.
Published: (2026)

MILP-SAT-GNN: Yet Another Neural SAT Solver
by: Cardillo, Franco Alberto, et al.
Published: (2025)

Certified MaxSAT Preprocessing
by: Ihalainen, Hannes, et al.
Published: (2024)

Building a Foundation Model for Trajectory from Scratch
by: Merten, Gaspard, et al.
Published: (2025)

DQN Performance with Epsilon Greedy Policies and Prioritized Experience Replay
by: Perkins, Daniel, et al.
Published: (2025)

OracleTSC: Oracle-Informed Reward Hurdle and Uncertainty Regularization for Traffic Signal Control
by: Jacob, Darryl, et al.
Published: (2026)

Go-Oracle: Automated Test Oracle for Go Concurrency Bugs
by: Tsimpourlas, Foivos, et al.
Published: (2024)

Greedy-DiM: Greedy Algorithms for Unreasonably Effective Face Morphs
by: Blasingame, Zander W., et al.
Published: (2024)

Resource-Constrained Heuristic for Max-SAT
by: Matejek, Brian, et al.
Published: (2024)

Solving Cyclic Antibandwidth Problem by SAT
by: Xuan, Hieu Truong, et al.
Published: (2026)

Learning to Search and Searching to Learn for Generalization in Planning
by: Aichmüller, Michael, et al.
Published: (2026)

AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
by: Jha, Piyush, et al.
Published: (2024)

V15 - Recursive Symbolic Intelligence - φ-Ache Recursive Collapsors and the Collapse Oracle Engine
by: Foster, Camaron
Published: (2025)

Greedy Is a Strong Default: Agents as Iterative Optimizers
by: Li, Yitao
Published: (2026)

Orbitopal Fixing in SAT
by: Anders, Markus, et al.
Published: (2026)

Orthologic for SAT Solving
by: de Haldat, Vladislas, et al.
Published: (2026)

LoRA as Oracle
by: Arazzi, Marco, et al.
Published: (2026)

High-Throughput SAT Sampling
by: Ardakani, Arash, et al.
Published: (2025)

W2SAT: Learning to generate SAT instances from Weighted Literal Incidence Graphs
by: Wen, Weihuang, et al.
Published: (2023)

Decoupling Generation and Evaluation for Parallel Greedy Best-First Search(extended version)
by: Shimoda, Takumi, et al.
Published: (2024)

Greedy Is Enough: Sparse Action Discovery in Agentic LLMs
by: Majumdar, Angshul
Published: (2026)

Self-Improvement Imitation with Biologically Guided Search for Protein Design Under Oracle Budgets
by: Khanna, Ashima, et al.
Published: (2026)

Solving the Two-dimensional single stock size Cutting Stock Problem with SAT and MaxSAT
by: Van Kieu, Tuyen, et al.
Published: (2026)

Using deep learning to construct stochastic local search SAT solvers with performance bounds
by: Kramer, Maximilian J., et al.
Published: (2023)