yusuke1997/dblp-id-title huggingface dataset:
A Conceptual Model of the Effect of Diverse Methodologies on Coincident Failures in Multi-Version Software
Reliable Multicast Protocols for a Token Ring Architecture
An agent-based Trading Infrastructure for Combinatorial Reverse Auctions
A hybrid computational intelligence approach for efficiently evaluating customer sentiments in E-commerce reviews
An adaptive type-2 fuzzy based charging technique for market design agents in uncertain environments
An Intelligent Agent Approach for Visual Information Structure Generation
A cognitive multi-agent system for emotion-aware ambient intelligence
A Multi-Coordination based Process for the Design of Mobile Agent Interactions
How Emotional Mechanism Helps Episodic Learning in a Cognitive Agent
An optimized self-organized approach to manage communication in wireless instrumentation systems
A bio-inspired agent-based system for controlling robot behaviour
2013 IEEE Symposium on Intelligent Agents, IA 2013, Singapore, April 16-19, 2013
Intelligent agents for games and computer Go
Cooperative induction of decision trees
Agent-assisted tagging aimed at folkonomy-based information retrieval
Malware behavioral analysis system: TWMAN
Semantic-based decision support for remote care of Dementia patients
Learning by Teaching versus Learning by Doing: Knowledge Exchange in Organic Agent Systems
A Pre-Kernel Agent Platform for security assurance
An agent-based infrastructure for monitoring aviation pilot's situation awareness
Distributed Agent-Based Social Simulations: An architecture to simulate complex social phenomena on highly parallel computational environments
Lesson authoring system for creating interactive activities involving virtual humans the thinking head whiteboard
Distributed intelligent management of microgrids using a multi-agent simulation platform
Benefits of routing and replanning with imperfect information
Output-based high-order bipartite consensus under directed antagonistic networks
Genetic algorithms in repeated matrix games: the effects of algorithmic modifications and human input with various associates
Agent Based Multipath Routing in Wireless Sensor Networks
Fuzzy Logic to Fuse Data Communicated Among Multiple Pursuing Agents
Information Leakage Detection in Distributed Systems using Software Agent
A grand challenge for computational intelligence a micro-environment benchmark for adaptive autonomous intelligent agents
Collaborative memetic agents for enabling semantic interoperability
A Strategy for Converging Dynamic Action Policies
Hybrid methodologies to foster ontology-based knowledge management platform
Data mining approach to support the generation of Realistic Scenarios for multi-agent simulation of electricity markets
Interoperable services based on activity monitoring in Ambient Assisted Living environments
Naïve creature learns to cross a highway in a simulated CA-like environment
Occupancy monitoring in intelligent environment through integrated wireless localizing aggents
Prediction of mobility entropy in an Ambient Intelligent environment
2011 IEEE Symposium on Intelligent Agent, IA 2011, Paris, France, April 14-15, 2011
A Bi-Clustering Agent-based Approach for Map Segmentation
Ontology-based Intelligent Fuzzy Agent for Diabetes Application
2014 IEEE Symposium on Intelligent Agents, IA 2014, Orlando, FL, USA, December 9-12, 2014
Semantic modeling & understanding of environment behaviors
Scenarios generation for multi-agent simulation of electricity markets based on intelligent data analysis
Application of intention awareness and sentic computing for sensemaking in joint-cognitive systems
Developing game-playing agents that adapt to user strategies: A case study
Simulation and Modeling of Group Behavior during Emergency Evacuation
Multiagent system for adaptive strategy formulation in electricity markets
Proceedings of the IEEE Symposium on Intelligent Agents, IA 2009, part of the IEEE Symposium Series on Computational Intelligence 2009, Nashville, TN, USA, March 30, 2009 - April 2, 2009
Relation Learning with Bar Charts
Human perceptions of altruism in artificial agents
Holonic systems as software paradigms for industrial automation and environmental monitoring
Finding an Unknown Goal in an Environment by a Group of Agents
Fuzzy Markup Language: A new solution for transparent intelligent agents
Impact of Structuring Elements on Agents' Behavior in Social Simulations
Random Walk in Extreme Conditions - An Agent Based Simulation of Suicide Bombing
Migration and social networks - An explanatory multi-evolutionary agent-based model
A Fuzzy Based Agent for Group Decision Support of Applicants Ranking within Recruitment Systems
Fuzzy agents for semantic web services discovery: experiences in medical diagnostic systems
Expected payoff analysis of dynamic mixed strategies in an adversarial domain
Human activity recognition in smart homes: Combining passive RFID and load signatures of electrical devices
A Proposal for Realizing Adaptive Ambient Ecologies through an ontology-based Multi-Agent System
Distributed team formation in urban disaster environments
Design considerations for COSA 2
Towards an agent-based architecture for managing uncertainty in situation awareness
Scalable Multilevel and Memetic Signed Graph Clustering
Navigation in Real-World Complex Networks through Embedding in Latent Spaces
Simple and Robust Dynamic Two-Dimensional Convex Hull
Acceleration of K-Means and Related Clustering Algorithms
RETRACTED: Linear Assignment on Tile-Centric Accelerators: Redesigning Hungarian Algorithm on IPUs
Engineering External Memory Induced Suffix Sorting
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, ALENEX 2010, Austin, Texas, USA, January 16, 2010
Engineering Multi-Level Overlay Graphs for Shortest-Path Queries
Quadratic Convergence for Scaling of Matrices
Summarizing Spatial Data Streams Using ClusterHulls
An Empirical Comparison of Graph Laplacian Solvers
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, USA, January 10, 2004
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing
Real-Time k-bounded Preemptive Scheduling
Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service
Region-based Approximation Algorithms for Visibility between Imprecise Locations
A Min-Edge Cost Flow Framework for Capacitated Covering Problems
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study
Approximating the True Evolutionary Distance between Two Genomes
SAT-and-Reduce for Vertex Cover: Accelerating Branch-and-Reduce by SAT Solving
Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
Exact Pattern Matching with Feed-Forward Bloom Filters
On the Average Density and Selectivity of Nodes in Multi-Digit Tries
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours
Lower Bounds for Sorting 16, 17, and 18 Elements
Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks
StreamKM++: A Clustering Algorithms for Data Streams
Distributed Graph-based Topology Adaptation using Motif Signatures
Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation
SHARC: Fast and Robust Unidirectional Routing
Approximating Betweenness Centrality in Large Evolving Networks
Practical Minimum Cut Algorithms
Batch-Parallel Euler Tour Trees
Fast Compressed Tries through Path Decompositions
Engineering Kernelization for Maximum Cut
The cost of address translation
HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees
Experimental Comparison of Shortest Path Approaches for Timetable Information
Accessing the Internal Organization of Data Structures in the JDSL Library
Computation of a Class of COntinued Fraction Constants
Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm
CSA++: Fast Pattern Search for Large Alphabets
Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification
Proceedings of the 26th Symposium on Algorithm Engineering and Experiments, ALENEX 2024, Alexandria, VA, USA, January 7-8, 2024
Travel Planning with Self-Made Maps
Quasirandom Rumor Spreading: An Experimental Analysis
k -way Hypergraph Partitioning via n -Level Recursive Bisection
Counting Eulerian Circuits is #P-Complete
Proceedings of the 24th Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022
Proceedings of the 23rd Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021
Triangle Listing Algorithms: Back from the Diversion
Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures
Growing Balls in ℝ d
Lempel-Ziv factorization: Simple, fast, practical
Distributed Computation of Persistent Homology
Cache Replacement with Memory Allocation
Avoiding Communication in Numerical Linear Algebra
User-Constrained Multi-Modal Route Planning
Improved Single-Term Top- k Document Retrieval
McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems
On Unifying the Space of ℓ 0 -Sampling Algorithms
Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm
Experimental Evaluation of Fully Dynamic k -Means via Coresets
Group Centrality Maximization for Large-scale Graphs
Hierarchical Clustering of Trees: Algorithms and Experiments
Distance-Sensitive Bloom Filters
Trade Off Between Compression and Search Times in Compact Suffix Array
Optimal Incremental Sorting
Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach
3D kinetic alpha complexes and their implementation
A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
Heuristics and Experimental Design for Bigraph Crossing Number Minimization
Computing Top- k Closeness Centrality Faster in Unweighted Graphs
Engineering Motif Search for Large Graphs
An Experimental Study of Old and New Depth Measures
Precomputation techniques for the stochastic on-time arrival problem
Scaling up Group Closeness Maximization
Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning
Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching
Practical Batch-Updatable External Hashing with Sorting
Exact Solutions and Bounds for General Art Gallery Problems
Determining Tournament Payout Structures for Daily Fantasy Sports
Spectral Analysis for Data Mining
An Efficient Algorithm for the 1D Total Visibility-Index Problem
PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets
Hardware-Assisted Natural Neighbor Interpolation
Efficient Bulk Operations on Dynamic R-trees
An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web
Experiments on Density-Constrained Graph Clustering
Routing in Graphs with Applications to Material Flow Problems
Multi-Pivot Quicksort: Theory and Experiments
Faster Approximation Algorithm for the k -Regret Minimizing Set and Related Problems
Drawing Binary Tanglegrams: An Experimental Evaluation
Engineering Data Reduction for Nested Dissection
Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings
Parallel Unconstrained Local Search for Partitioning Irregular Graphs
Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results
Shared-Memory n-level Hypergraph Partitioning
An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances
Theory and Practise of Monotone Minimal Perfect Hashing
Counting Polyominoes, Revisited
Scalable Shared-Memory Hypergraph Partitioning
Learning to Prune Instances of k -median and Related Problems
Short and Simple Cycle Separators in Planar Graphs
Computing MaxMin Edge Length Triangulations
Designing Practical Efficient Algorithms for Symmetric Multiprocessors
An Exact Approach to Upward Crossing Minimization
Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm
Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX 2013, New Orleans, Louisiana, USA, January 7, 2013
Open Problems from ALENEX 2003
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering
Route Planning with Flexible Objective Functions
A Data-Aware FM-index
Gap-Free Samples of Geometric Random Variables
Faster Support Vector Machines
Optimizing Search Layouts in Packed Memory Arrays
Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation
Discrete Transforms of Quantized Persistence Diagrams
New Algorithmic Challenges Arising in Measurement-Driven Networking Research
Karp-Sipser based kernels for bipartite graph matching
An Experimental Analysis of a Compact Graph Representation
Alternative Multicriteria Routes
The Robustness of the Sum-of-Squares Algorithm for Bin Packing
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
Rank Aggregation: Together We're Strong
An Improvement on Tree Selection Sort
Filtration-Domination in Bifiltered Graphs
Approximating the Visible Region of a Point on a Terrain
CNOP - A Package for Constrained Network Optimization
On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs
Batched k-Mer Lookup on the Spectral Burrows-Wheeler Transform
A New Decoding Algorithm for Statistical Machine Translation: Design and Implementation
An Empirical Study of a New Approach to Nearest Neighbor Searching
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark
Linearization: Locally Self-Stabilizing Sorting in Graphs
Parallel d -D Delaunay Triangulations in Shared and Distributed Memory
Topological Sweep in Degenerate Cases
Top-k Substring Matching for Auto-Completion
A Greedy Algorithm for Low-Crossing Partitions for General Set Systems
Proceedings of the 27th Symposium on Algorithm Engineering and Experiments, ALENEX 2025, New Orleans, LA, USA, January 12-13, 2025
Safe Seperators for Treewidth
I/O-Efficient Event Based Depression Flood Risk
A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers
Consensus Clustering Algorithms: Comparison and Refinement
Computational Challenges from the Tree of Life
Simplifying massive planar subdivisions
Simple, Fast and Lightweight Parallel Wavelet Tree Construction
An I/O-efficient Distance Oracle for Evolving Real-World Graphs
Distribuional Analyses of Euclidean Algorithms
Practical Fully Dynamic Minimum Cut Algorithms
Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling
Proceedings of the 25th Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023
Experimental Evaluation of a New Shortest Path Algorithm
Data Reduction, Exact, and Heuristic Algorithms for Clique Cover
Engineering Fully Dynamic Exact ∆-Orientation Algorithms
Distributed Routing in Small-World Networks
The Complexity of Jensen's Algorithm for Counting Polyominoes
Better External Memory Suffix Array Construction
Object-Oriented Design of Graph Oriented Data Structures
Compositions and Patricia Tries: No Fluctuations in the Variance!
Distributed Evolutionary Graph Partitioning
Employing (1 - epsilon) Dominating Set Partitions as Backbones in Wireless Sensor Networks
Experimental comparison of the two Fredman-Khachiyan-algorithms
Lossy Reduction Rules for the Directed Feedback Vertex Set Problem
Towards the 5/6-Density Conjecture of Pinwheel Scheduling
Evaluation of an MSO-Solver
Algorithm Engineering and Experimentation, International Workshop ALENEX '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers
Robust gossip-based aggregation: A practical point of view
Computing Top- k Closeness Centrality in Fully-dynamic Graphs
The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry)
Implementation and Parallelization of a Reverse-Search Algorithm for Minkowski Sums
Implementation of a PTAS for Scheduling with Release Dates
Area-Preserving Subdivision Simplification with Topology Constraints: Exactly and in Practice
Transit Nodes - Lower Bounds and Refined Construction
Computation of Large Asymptotics of 3-Manifold Quantum Invariants
Patial Quicksort
A Simple Primality Test and th rth Smallest Prime Factor
Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs
Computing Optimal Hypertree Decompositions
Practical Experience with Hanani-Tutte for Testing c-Planarity
Dependent Randomized Rounding: The Bipartite Case
Algorithms to Take Advantage of Hardware Prefetching
A Time-Sensitive System for Black-Box Combinatorial Optimization
Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce
Partitioning Planar Graphs with Costs and Weights
Using Multi-level Graphs for Timetable Information in Railway Systems
Fast Prefix Matching of Bounded Strings
Flow-Based Guidebook Routing
The Treewidth of Java Programs
Interactive Exploration of the Temporal α-Shape
Solving Maximum Flow Problems on Real World Bipartite Graphs
(Semi-)External Algorithms for Graph Partitioning and Clustering
Engineering a Sorted List Data Structure for 32 Bit Key
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems
Analysis and Experimental Evaluation of Time-Dependent Distance Oracles
A Probabilistic Spell for the Curse of Dimensionality
Succinct Trees in Practice
Disjoint-Path Facility Location: Theory and Practice
The Johnson-Lindenstrauss Transform: An Empirical Study
Shared-Memory Branch-and-Reduce for Multiterminal Cuts
On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem
Practical Constraction of Metric t-Spanners
Computing Point-to-Point Shortest Paths from External Memory
Efficient Exact Geometric Predicates for Delauny Triangulations
Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme
Distance Closures: Unifying Search- and Lookup-based Shortest Path Speedup Techniques
An Algorithm for Online K-Means Clustering
Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points
Implementing Streaming Simplification for large Labeled Meshes
Approximate Map Matching with respect to the Fréchet Distance
Concatenated k-Path Covers
Ranking Tournaments: Local Search and a New Algorithm
Better Approximation of Betweenness Centrality
Computing Visibility on Terrains in External Memory
Generating Massive Scale-Free Networks under Resource Constraints
Approximation of trees by self-nested trees
Budgeted Maximum Coverage with Overlapping Costs: Monitoring the Emerging Infections Network
I/O-efficient Point Location Using Persistent B-Trees
Compact Routing on Power Law Graphs with Additive Stretch
Maintaining Discrete Probability Distributions in Practice
Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk)
Proceedings of the 22nd Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020
Worst-Case Efficient Sorting with QuickMergesort
Computing the n × m Shortest Paths Efficently
Engineering a Distributed Full-Text Index
Time-Dependent Contraction Hierarchies
A General Framework for Dynamic Succinct and Compressed Data Structures
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016
Adaptive Algorithms for Cache-Efficient Trie Search
Reverse-Safe Data Structures for Text Indexing
An Efficient Branch-and-Bound Solver for Hitting Set
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems
Grid peeling and the affine curve-shortening flow
Fast Packed String Matching for Short Patterns
An SDP Approach to Multi-level Crossing Minimization
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018
Approximating Multiobjective Shortest Path in Practice
Load Balancing: The Long Road from Theory to Practice
Experimental Evaluation of Distributed Node Coloring Algorithms for Wireless Networks
An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem
Fully Dynamic k -Center Clustering in Low Dimensional Metrics
2-Fault-Tolerant Strong Connectivity Oracles
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs
Reach for A*: Efficient Point-to-Point Shortest Path Algorithms
A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem
Experimental Results on Statistical Approaches to Page Replacement Policies
Fast Minimal Presentations of Bi-graded Persistence Modules
Fast Multimodal Journey Planning for Three Criteria
Elias-Fano meets Single-Term Top- k Document Retrieval
Tuning BNDM with q-Grams
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2011, Holiday Inn San Francisco Golden Gateway, San Francisco, California, USA, January 22, 2011
A Back-to-Basics Empirical Study of Priority Queues
An Experimental Study of Point Location in General Planar Arrangements
Computing Graph Hyperbolicity Using Dominating Sets
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects
Order constraints for single machine scheduling with non-linear cost
Fast Reconfiguration of Data Placement in Parallel Disks
Practical Entropy-Compressed Rank/Select Dictionary
A Generic Framework for Engineering Graph Canonization Algorithms
Perturbation Analysis of Practical Algorithms for the Maximum Scatter Travelling Salesman Problem
Inducing Suffix and Lcp Arrays in External Memory
Faster Filters for Approximate String Matching
Engineering Optimal Parallel Task Scheduling
A "Learned" Approach to Quicken and Compress Rank/Select Dictionaries
Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types
Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes
A Closer Look at the Closest String and Closest Substring Problem
On the Scalability of Computing Triplet and Quartet Distances
Round-Based Public Transit Routing
Algorithmic Problems in Air Traffic Management
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7-8, 2019
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets
2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2014, Portland, Oregon, USA, January 5, 2014
LZ77 via Prefix-Free Parsing
Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover
Parallel Nearest Neighbors in Low Dimensions with Batch Updates
Fast and Lightweight LCP-Array Construction Algorithms
Connection Scan Accelerated
ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
Interpolation over Light Fields with Applications in Computer Graphics
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
Solving the Minimum String Cover Problem
Faster Placement of Hydrogens in Protein Structures by Dynamic Programming
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
A Computational Framework for Handling Motion
Intersection in Integer Inverted Indices
A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction
Fast and Delay-Robust Multimodal Journey Planning
Streaming Set Cover in Practice
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007
Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers
Efficient Set Intersection Counting Algorithm for Text Similarity Measures
Biased Skip Lists for Highly Skewed Access Patterns