2214 search results - page 254 / 443 » Complexity of Reasoning |
128
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
140
Voted
ATAL
2000
Springer
15 years 8 months ago
2000
Springer
A perennial challenge in creating and using complex autonomous agents is following their choices of actions as the world changes dynamically and understanding why they act as they ...
149
Voted
AGP
1996
IEEE
15 years 7 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
145
Voted
AGP
1994
IEEE
15 years 7 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
123
Voted
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
The vision of ubiquitous computing is one in which resource constrained mobile devices form ad-hoc networks to enable the delivery of services that are sensitive and responsive to...