4737 search results - page 675 / 948 » The LOGIC negotiation model |
199
click to vote
COCOON
2003
Springer
16 years 18 days ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
191
click to vote
ECAI
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Autonomous agents operating in complex dynamic environments need the ability to integrate robust plan execution with higher level reasoning. This paper describes work to ...
170
click to vote
TPHOL
1999
IEEE
15 years 11 months ago
1999
IEEE
Gandalf is a first-order resolution theorem-prover, optimized for speed and specializing in manipulations of large clauses. In this paper I describe GANDALF TAC, a HOL tactic that ...
190
click to vote
DFT
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper presents a system to evaluate the testability of an on-line testable circuit. The system operates at the RT-level, before the logic synthesis step, and allows for an ex...
184
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Abstract. The inherently sequential nature of random discrete eventdriven simulation has made parallel and distributed processing di cult. This paper presents a method of applying ...