Sciweavers

68 search results - page 3 / 14
» Grounding with Bounds
Sort
View
ATAL
2004
Springer
14 years 1 months ago
A Complete and Decidable Logic for Resource-Bounded Agents
We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The seman...
Natasha Alechina, Brian Logan, Mark Whitsey
CORR
2008
Springer
101views Education» more  CORR 2008»
13 years 7 months ago
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
Joshua Brody, Amit Chakrabarti
ICS
2010
Tsinghua U.
13 years 12 months ago
Bounds on the Quantum Satisfiability Threshold
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
Sergey Bravyi, Cristopher Moore, Alexander Russell
ICLP
2010
Springer
13 years 11 months ago
Efficient Solving of Time-dependent Answer Set Programs
Answer set programs with time predicates are useful to model systems whose properties depend on time, like for example gene regulatory networks. A state of such a system at time po...
Timur Fayruzov, Jeroen Janssen, Dirk Vermeir, Chri...
ICCAD
1997
IEEE
131views Hardware» more  ICCAD 1997»
13 years 12 months ago
COSMOS: a continuous optimization approach for maximum power estimation of CMOS circuits
Maximum instantaneous power in VLSI circuits has a great impact on circuit's reliability and the design of power and ground lines. To synthesizehighlyreliablesystems,accurate...
Chuan-Yu Wang, Kaushik Roy