yusuke1997/dblp-id-title huggingface dataset:
Algorithmic Analysis of Priority-Based Bin Packing
On Collections of Polygons Cuttable with a Segment Saw
On Coupon Coloring of Cartesian Product of Some Graphs
Maintaining the Visibility Graph of a Dynamic Simple Polygon
Parameterized Algorithms for Directed Modular Width
Optimal Embedding of Locally Twisted Cubes into Grids
On Conflict-Free Spanning Tree: Algorithms and Complexity
New Characterizations of Proper Interval Bigraphs and Proper Circular Arc Bigraphs
New Polynomial Case for Efficient Domination in P 6-free Graphs
On the Intersections of Non-homotopic Loops
Relative Clique Number of Planar Signed Graphs
Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System
Mixed Unit Interval Bigraphs
Improved Descriptional Complexity Results on Generalized Forbidding Grammars
On Query Complexity Measures and Their Relations for Symmetric Functions
Axiomatic Characterization of the Interval Function of a Bipartite Graph
Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs
Location-Domination Type Problems Under the Mycielski Construction
Positional Dominance: Concepts and Algorithms
On Three Domination-Based Identification Problems in Block Graphs
A Proof of the Multiplicative 1-2-3 Conjecture
Efficient Reductions and Algorithms for Subset Product
Some Distance Antimagic Labeled Graphs
Polynomial Time Algorithms for Hop Domination
On cd-Coloring of Trees and Co-bipartite Graphs
The Frobenius Problem for the Proth Numbers
Algorithms and Discrete Applied Mathematics - 10th International Conference, CALDAM 2024, Bhilai, India, February 15-17, 2024, Proceedings
The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability
Greedy Universal Cycle Constructions for Weak Orders
Relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs
New Directions in Approximate Nearest-Neighbor Searching
Algorithms and Discrete Applied Mathematics - 8th International Conference, CALDAM 2022, Puducherry, India, February 10-12, 2022, Proceedings
A Sub-quadratic Algorithm for the Minsum One Sink Location Problem on Balanced Binary Tree Networks
Structural Parameterization of Minus Domination
Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings
Consistent Subset Problem with Two Labels
On the Parameterized Complexity of Odd Coloring
An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity
Algorithms for Problems on Maximum Density Segment
Improved Algorithm for Maximum Independent Set on Unit Disk Graph
Rectilinear Path Problems in Restricted Memory Setup
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs
Cause I'm a Genial Imprecise Point: Outlier Detection for Uncertain Data
Cyclability, Connectivity and Circumference
The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs
Localized Query: Color Spanning Variations
Indicated Coloring of Complete Expansion and Lexicographic Product of Graphs
Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs
Forbidden Induced Subgraphs in Iterative Higher Order Line Graphs
On the Tractability of (k, i)-Coloring
Memory Optimal Dispersion by Anonymous Mobile Robots
Packing Sets of Paths, Stars and Triangles: Tractability and Approximability
Maximum Weighted Independent Sets with a Budget
Perfectness of G-generalized Join of Graphs
Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms
Demand Hitting and Covering of Intervals
Lexicographic Product of Digraphs and Related Boundary-Type Sets
Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function
Lattice Spanners of Low Degree
Polynomial Time Algorithms for Bichromatic Problems
On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices
On Oriented L(p, 1)-labeling
On Parameterized Complexity of Liquid Democracy
Open Packing in H-free Graphs and Subclasses of Split Graphs
Hamiltonicity in Split Graphs - A Dichotomy
Self-centeredness of Generalized Petersen Graphs
Cops and Robber on Butterflies and Solid Grids
Linear-Time Fitting of a k-Step Function
The Balanced Connected Subgraph Problem
Algorithms for k-Dispersion for Points in Convex Position in the Plane
Elusiveness of Finding Degrees
On Cartesian Products of Signed Graphs
A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems
Multipacking in the Euclidean Metric Space
Balanced Connected Graph Partition
Partitioning Cographs into Two Forests and One Independent Set
Variations of Cops and Robbers Game on Grids
A Lower Bound of the cd-Chromatic Number and Its Complexity
Semitotal Domination on AT-Free Graphs and Circle Graphs
On cd-Coloring of P 5, K 4 -free Chordal Graphs
Structured Instances of Restricted Assignment with Two Processing Times
The Lexicographic Method for the Threshold Cover Problem
Energy Efficient Sweep Coverage with Mobile and Static Sensors
The MASEMPR Problem and Its Applications in Logistics
Finding Large Independent Sets in Line of Sight Networks
Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter
Algorithms for Online Car-Sharing Problem
The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)
A New Construction of Broadcast Graphs
Polynomial-Time Algorithms for Path Cover on Trees and Graphs of Bounded Treewidth
On the Geodetic and Hull Numbers of Shadow Graphs
Separator Theorems for Interval Graphs and Proper Interval Graphs
Exact and Parameterized Algorithms for (k, i)-Coloring
B 0 -VPG Representation of AT-free Outerplanar Graphs
Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs
Querying Relational Event Graphs Using Colored Range Searching Data Structures
Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem
Bipartite Domination in Graphs: Complexity and Algorithms
Weak Roman Bondage Number of a Graph
Helly Number, Radon Number and Rank in $\varDelta $-Convexity on Graphs
Algorithms and Discrete Applied Mathematics - 11th International Conference, CALDAM 2025, Coimbatore, India, February 13-15, 2025, Proceedings
Coloring of a Superclass of 2K 2 -free graphs
Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential Gaps
On Structural Parameterizations of Load Coloring
Monitoring Edge-Geodetic Sets in Graphs
Bounds for the b-chromatic Number of Induced Subgraphs and G - e
Algorithms and Discrete Applied Mathematics - 9th International Conference, CALDAM 2023, Gandhinagar, India, February 9-11, 2023, Proceedings
Incremental Algorithms to Update Visibility Polygons
Algebraic Algorithms for Variants of Subset Sum
An Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs
Arbitrary-Oriented Color Spanning Region for Line Segments
On Fair Division with Binary Valuations Respecting Social Networks
Generalized Lettericity of Graphs
An Algebraic Characterization of Strong Graphs
Diverse Fair Allocations: Complexity and Algorithms
A Tight Bound for Congestion of an Embedding
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products
Maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength
Chromatic Bounds for Some Subclasses of $(P_3\cup P_2)$-free graphs
On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs
List Homomorphisms to Separable Signed Graphs
AND-Decomposition of Boolean Polynomials with Prescribed Shared Variables
Fixed-Parameter Tractable Algorithms for Tracking Set Problems
Characterizations of H-graphs
Determining Minimal Degree Polynomials of a Cyclic Code of Length 2^k over \mathbb Z_8
Fault-Tolerant Additive Weighted Geometric Spanners
Overlaying a Hypergraph with a Graph with Bounded Maximum Degree
Maximum Weighted Edge Biclique Problem on Bipartite Graphs
Semi-total Domination in Unit Disk Graphs
Bumblebee Visitation Problem
Linear Time Algorithm to Check the Singularity of Block Graphs
Scheduling Trains with Small Stretch on a Unidirectional Line
The Induced Star Partition of Graphs
$\varDelta $-Convexity Number and $\varDelta $-Number of Graphs and Graph Products
Voronoi Games Using Geodesics
New Variants of Perfect Non-crossing Matchings
Partial Domination in Some Geometric Intersection Graphs
Resource Management in Device-to-Device Communications
Extension Perfect Roman Domination
Fault-Tolerant Dispersion of Mobile Robots
Algorithms and Complexity of Strongly Stable Non-crossing Matchings
On the Simultaneous Minimum Spanning Trees Problem
Parameterized Complexity of Locally Minimal Defensive Alliances
Star Covers and Star Partitions of Cographs and Butterfly-free Graphs
Bounded Stub Resolution for Some Maximal 1-Planar Graphs
On Chromatic Number of Colored Mixed Graphs
The Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures
On Colouring Point Visibility Graphs
The Relative Signed Clique Number of Planar Graphs is 8
On Structural Parameterizations of Firefighting
Induced Matching in Some Subclasses of Bipartite Graphs
The Relative Oriented Clique Number of Triangle-Free Planar Graphs Is 10
On the Parameterized Complexity of Spanning Trees with Small Vertex Covers
Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions
Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Hyderabad, India, February 13-15, 2020, Proceedings
On Structural Parameterizations of Graph Motif and Chromatic Number
Drawing Graphs on Few Circles and Few Spheres
Algorithms and Discrete Applied Mathematics - Second International Conference, CALDAM 2016, Thiruvananthapuram, India, February 18-20, 2016, Proceedings
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
Vertex-Edge Domination in Unit Disk Graphs
On Algorithms to Find p-ordering
Arbitrary Pattern Formation by Opaque Fat Robots with Lights
Algorithms and Discrete Applied Mathematics - 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings
b-Coloring of the Mycielskian of Regular Graphs
5-List Coloring Toroidal 6-Regular Triangulations in Linear Time
Minimum Consistent Subset of Simple Graph Classes
Vertex Guarding in Weak Visibility Polygons
Online Bin Packing with Overload Cost
Hardness Results of Global Total k-Domination Problem in Graphs
On Full-Separating Sets in Graphs
Auction/Belief Propagation Algorithms for Constrained Assignment Problem
Probabilistic Properties of Highly Connected Random Geometric Graphs
Stability Number and k-Hamiltonian [a, b]-factors
On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees
Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity
One-Sided Discrete Terrain Guarding and Chordal Graphs
Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications
Two Step Graph Protection Game
P Versus NPC: Minimum Steiner Trees in Convex Split Graphs
Characterization of Dense Patterns Having Distinct Squares
On the Complexity Landscape of the Domination Chain
Hamiltonian Path in K_1, t -free Split Graphs- A Dichotomy
Graph Covering Using Bounded Size Subgraphs
Hardness Results of Global Roman Domination in Graphs
Total Domination and Open Packing in Two Subclasses of Triangle-Free Graphs
Structural Parameterization of Alliance Problems
Bi-directional Search for Skyline Probability
On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements
Domination in Some Subclasses of Bipartite Graphs
Tree Path Labeling of Hypergraphs - A Generalization of the Consecutive Ones Property
m-Gracefulness of Graphs
A New Model in Firefighting Theory
Color Spanning Objects: Algorithms and Hardness Results
Improved Algorithms for Minimum-Membership Geometric Set Cover
Algorithms and Discrete Applied Mathematics - 5th International Conference, CALDAM 2019, Kharagpur, India, February 14-16, 2019, Proceedings
On Coupon Coloring of Cayley Graphs
On the Center Sets of Some Graph Classes
On Rank and MDR Cyclic Codes of Length 2 k Over Z 8
Ramsey Numbers for Line Graphs
On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs
Determining Number of Generalized and Double Generalized Petersen Graph
On a Tight Bound for the Maximum Number of Vertices that Belong to Every Metric Basis
Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two
Transitivity on Subclasses of Chordal Graphs
Approximating Modular Decomposition Is Hard
0-1 Timed Matching in Bipartite Temporal Graphs
Group Distance Magic Labeling of C n r
Fast FPT Algorithms for Grundy Number on Dense Graphs
Mind the Gap: Edge Facility Location Problems in Theory and Practice
Geometric Planar Networks on Bichromatic Points
Window Queries for Problems on Intersecting Objects and Maximal Points
Probabilistic Arguments in Graph Coloring (Invited Talk)
On the Connectivity and the Diameter of Betweenness-Uniform Graphs
The Connected Domination Number of Grids
Geometric Covering Number: Covering Points with Curves
Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms
Cyclic Codes over Galois Rings
Independent Sets in Classes Related to Chair-Free Graphs
On the Probability of Being Synchronizable
Graceful Coloring is Computationally Hard
Optimal Length Cutting Plane Refutations of Integer Programs
Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set
Smallest C 2l+1 -Critical Graphs of Odd-Girth 2k+1
On Total Chromatic Number of Complete Multipartite Graphs
Axiomatic Characterization of the Median Function of a Block Graph
On Graphs with Minimal Eternal Vertex Cover Number
Bounds and Algorithms for Geodetic Hulls
On m-Bonacci-Sum Graphs
Oriented Diameter of Star Graphs
Growth Rate of the Number of Empty Triangles in the Plane
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes
Lower Bounds on the Dilation of Plane Spanners
Minimum Maximal Acyclic Matching in Proper Interval Graphs
Spectra of Eccentricity Matrices of Product of Graphs
Liar's Domination in 2D
Approximation Algorithms for Cumulative VRP with Stochastic Demands
On Spectra of Corona Graphs
New Algorithms and Bounds for Halving Pseudolines
Cops and Robber on Oriented Graphs with Respect to Push Operation
Template-Driven Rainbow Coloring of Proper Interval Graphs
Subgraphs with Orthogonal [0, k i ] 1 n -Factorizations in Graphs
Waiting for Trains: Complexity Results
Hardness and Approximation Results for Some Variants of Stable Marriage Problem
Dominating Induced Matching in Some Subclasses of Bipartite Graphs
b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results
Cut Vertex Transit Functions of Hypergraphs
Impact of Diameter and Convex Ordering for Hamiltonicity and Domination
Optimum Gathering of Asynchronous Robots
Gathering over Meeting Nodes in Infinite Grid
Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs
Maximizing the Maximum Degree in Ordered Nearest Neighbor Graphs
Burning Spiders
There are Finitely Many Uniformly Most Reliable Graphs of Corank 5
Approximation and Parameterized Algorithms for Balanced Connected Partition Problems
Algorithms for Radon Partitions with Tolerance
Algebraic Expressions of Rhomboidal Graphs
Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings
Exact Computation of the Number of Accepting Paths of an NTM
Consecutive Occurrences with Distance Constraints
Covering and Packing of Triangles Intersecting a Straight Line
On Chordal and Perfect Plane Triangulations
Monitoring the Edges of a Graph Using Distances
Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs
Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime
Medians of Permutations: Building Constraints
Complexity of Restricted Variant of Star Colouring
Coresets for (k, ℓ )-Median Clustering Under the Fréchet Distance
An Efficient Interior Point Method for Linear Optimization Using Modified Newton Method
Failure and Communication in a Synchronized Multi-drone System
Minimum Conflict Free Colouring Parameterized by Treewidth
Broadcast Graph is NP-Complete
Parameterized Intractability of Defensive Alliance Problem
Charging Station Placement for Limited Energy Robots
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem
Line Segment Disk Cover
Efficient Domination and Efficient Edge Domination: A Brief Survey
On the Power Domination Number of Graph Products
Constant Approximation for Broadcasting in k-cycle Graph
Domination Parameters in Hypertrees
Acyclic Coloring Parameterized by Directed Clique-Width
Complexity of Steiner Tree in Split Graphs - Dichotomy Results
Comparability Graphs Among Cover-Incomparability Graphs
Total Coloring of Some Graph Operations
Approximation Algorithms in Graphs with Known Broadcast Time of the Base Graph
Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane
On the Minimum Satisfiability Problem
Algorithms and Discrete Applied Mathematics - First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings
On Hamiltonian Colorings of Trees
Almost Empty Monochromatic Polygons in Planar Point Sets
Three Paths to Point Placement
On Rectangle Intersection Graphs with Stab Number at Most Two
On the Approximability of Path and Cycle Problems in Arc-Dependent Networks
Burning Grids and Intervals
On Locally Identifying Coloring of Graphs
Parameterized Analogues of Probabilistic Computation
Chromatic Bounds for the Subclasses of pK 2 -Free Graphs
Planar Projections of Graphs
Latin Hexahedra and Related Combinatorial Structures
Recursive Methods for Some Problems in Coding and Random Permutations
Approximation Algorithms for Orthogonal Line Centers
Linear Time Algorithms for Euclidean 1-Center in \mathfrak R^d with Non-linear Convex Constraints
Computational Aspects of Double Dominating Sequences in Graphs
On Structural Parameterizations of Star Coloring
On a Special Class of Boxicity 2 Graphs
Radius, Diameter, Incenter, Circumcenter, Width and Minimum Enclosing Cylinder for Some Polyhedral Distance Functions
Associativity for Binary Parallel Processes: A Quantitative Study
Drawing Bipartite Graphs in Two Layers with Specified Crossings
Some Position Problems for Graphs
Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs
A Lower Bound for the Radio Number of Graphs
The Edge Geodetic Number of Product Graphs
Covering a Graph with Densest Subgraphs
Generation of Random Digital Curves Using Combinatorial Techniques
Algorithms and Hardness Results for the (3, 1)-Cover Problem
Randomization for Efficient Dynamic Graph Algorithms - (Invited Talk)
Parameterized Complexity of Coupon Coloring of Graphs
Axiomatic Characterization of the Toll Walk Function of Some Graph Classes
The cd-Coloring of Graphs
Parameterized Aspects of Distinct Kemeny Rank Aggregation
H-Free Coloring on Graphs with Bounded Tree-Width
Complexity of Paired Domination in AT-free and Planar Graphs
List Distinguishing Number of p th Power of Hypercube and Cartesian Powers of a Graph
Achieving Positive Rates with Predetermined Dictionaries
Star Colouring of Regular Graphs Meets Weaving and Line Graphs
On Indicated Coloring of Some Classes of Graphs
Some Insights on Dynamic Maintenance of Gomory-Hu Tree in Cactus Graphs and General Graphs
Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams
On Star Partition of Split Graphs
Distance-2-Dispersion with Termination by a Strong Team
Cumulative Vehicle Routing Problem: A Column Generation Approach
Complexity Results on Cosecure Domination in Graphs
b-Coloring of Some Powers of Hypercubes
On a Lower Bound for the Eccentric Connectivity Index of Graphs
RADBench: A Concurrency Bug Benchmark Suite
Parallel Synchronization-Free Approximate Data Structure Construction
Operating Systems Should Manage Accelerators
CONCURRIT: Testing Concurrent Programs with Programmable State-Space Exploration
A Template Library to Integrate Thread Scheduling and Locality Management for NUMA Multiprocessors
How to Miscompile Programs with "Benign" Data Races
For Extreme Parallelism, Your OS Is Sooooo Last-Millennium
5th USENIX Workshop on Hot Topics in Parallelism, HotPar'13, San Jose, CA, USA, June 24-25, 2013
Parallel Programming of General-Purpose Programs Using Task-Based Programming Models
Parallel Programming for the Web
A Case for Parallelizing Web Pages
...And Region Serializability for All
But How Do We Really Debug Transactional Memory Programs?
Understanding the Interleaving-Space Overlap across Inputs and Software Versions
Using Elimination and Delegation to Implement a Scalable NUMA-Friendly Stack
Three Fingered Jack: Tackling Portability, Performance, and Productivity with Auto-Parallelized Python
"Simultaneous" Considered Harmful: Modular Parallelism
CUDA-level Performance with Python-level Productivity for Gaussian Mixture Model Applications
Parallelization by Simulated Tunneling
Do We Need a Crystal Ball for Task Migration?
Collection-focused Parallelism
Enabling Multiple Accelerator Acceleration for Java/OpenMP
Property-Driven Cooperative Logging for Concurrency Bugs Replication
Pervasive Parallelism for Managed Runtimes
Crunching Large Graphs with Commodity Processors
Concurrency Attacks
Parallel Pattern Detection for Architectural Improvements
Parallelization Primitives for Dynamic Sparse Computations
Retrofitted Parallelism Considered Grossly Sub-Optimal
3rd USENIX Workshop on Hot Topics in Parallelism, HotPar'11, Berkeley, CA, USA, May 26-27, 2011
Towards Performance-Portable, Scalable, and Convenient Linear Algebra
Quarantine: Fault Tolerance for Concurrent Servers with Data-Driven Selective Isolation
Determinism Is Overrated: What Really Makes Multithreaded Programs Hard to Get Right and What Can Be Done About It
HydraVM: Extracting Parallelism from Legacy Sequential Code Using STM
Characterizing Real World Bugs Causing Sequential Consistency Violations
Parkour: Parallel Speedup Estimates for Serial Programs
Deterministic OpenMP for Race-Free Parallelism
Disciplined Concurrent Programming Using Tasks with Effects
A Relativistic Enhancement to Software Transactional Memory
Parallel Closures: A New Twist on an Old Idea
Constrained Data-Driven Parallelism
Multicore Performance Optimization Using Partner Cores
Parakeet: A Just-In-Time Parallel Accelerator for Python
Durability Semantics for Lock-based Multithreaded Programs
Fine-Grained Resource Sharing for Concurrent GPGPU Kernels
Balance Principles for Algorithm-Architecture Co-Design
Considerations When Evaluating Microprocessor Platforms
4th USENIX Workshop on Hot Topics in Parallelism, HotPar'12, Berkeley, CA, USA, June 7-8, 2012
IWSSL2024: Introduction to this Volume
Continuous Learning of Action and State Spaces (CLASS)
The "Explanation Hypothesis" in General Self-Supervised Learning
Situated Self-guided Learning - 4th International Workshop, IWSSL 2024, Oxford, UK, September 12-13, 2024, Proceedings
IWSSL: Introduction to this volume
International Workshop on Self-Supervised Learning, 28-29 July 2022, Reykjavik University, Reykjavik, Iceland
International Workshop on Self-Supervised Learning, IWSSL 2021, 13-14 August 2021, Virtual Event
The Future of AI Research: Ten Defeasible ‘Axioms of Intelligence’
Introduction to this volume
Seed-Programmed Autonomous General Learning
Symbolic Guidance for Constructivist Learning by Neural Model
Hybrid AI for IoT Actionable Insights & Real-Time Data-Driven Networks
Simultaneous Localization and Active Phenomenon Inference (SLAPI)
Society of LLMs: Constructivist Learning Approaches with Multiple LLM Instances
Proceedings of the International Workshop on Self-Supervised Learning, IWSSL 2020, Cambridge, MA, USA
The Holon System: Artificial General Intelligence as ‘Work on Command’
Intelligence Tests for AI
Intelligence: From Definition to Design
Comparison of Machine Learners on an ABA Experiment Format of the Cart-Pole Task