Search Results for author:
Found 8 papers, 2 papers with code
Reframing the Mind-Body Picture: Applying Formal Systems to the Relationship of Mind and Matter
This paper aims to show that a simple framework, utilizing basic formalisms from set theory and category theory, can clarify and inform our theories of the relation between mind and matter.
Real-Time Systems Optimization with Black-box Constraints and Hybrid Variables
When optimizing real-time systems, designers often face a challenging problem where the schedulability constraints are non-convex, non-continuous, or lack an analytical form to understand their properties.
A General and Scalable Method for Optimizing Real-Time Systems
In real-time systems optimization, designers often face a challenging problem posed by the non-convex and non-continuous schedulability conditions, which may even lack an analytical form to understand their properties.
Optimizing Logical Execution Time Model for Both Determinism and Low Latency
Therefore, fLET has the potential to significantly improve the end-to-end timing performance while keeping the benefits of deterministic behavior on timing and dataflow.
MAJORITY-3SAT (and Related Problems) in Polynomial Time
For the closely related GtMajority-SAT problem (where we ask whether a given formula has greater than $2^{n-1}$ satisfying assignments) which is known to be PP-complete, we show that GtMajority-$k$SAT is in P for $k\le 3$, but becomes NP-complete for $k\geq 4$.
Learning Multi-Agent Communication through Structured Attentive Reasoning
Learning communication via deep reinforcement learning has recently been shown to be an effective way to solve cooperative multi-agent tasks.
Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits
$\bullet$ We give tight average-case (gate and wire) complexity results for computing PARITY with depth-two threshold circuits; the answer turns out to be the same as for depth-two majority circuits.
Faster all-pairs shortest paths via circuit complexity
On the word RAM, the algorithm runs in $n^3/2^{\Omega(\log n)^{1/2}} + n^{2+o(1)}\log M$ time for edge weights in $([0, M] \cap {\mathbb Z})\cup\{\infty\}$.
Data Structures and Algorithms Computational Complexity Combinatorics
