Search Results for author:
Found 3 papers, 1 papers with code
Planning with Biological Neurons and Synapses
We revisit the planning problem in the blocks world, and we implement a known heuristic for this task.
On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks
Our algorithm can be used to solve several different minimum cost path problems in weighted point-availability time-dependent networks with a vast variety of cost definitions, and it can be easily modified in order to deal with the single destination Pareto problem.
Data Structures and Algorithms Networking and Internet Architecture
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies
Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata, are unlike context-free grammars in that they do not have a binary normal form.
