723 search results - page 55 / 145 » Reducing the complexity of the issue logic |
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
TASE
2008
IEEE
14 years 2 months ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
DELTA
2004
IEEE
13 years 11 months ago
2004
IEEE
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
GLOBECOM
2008
IEEE
13 years 8 months ago
2008
IEEE
— Nodes forming mobile ad hoc networks (MANET) nodes can be logically partitioned into 1) a selfish user agent serving the interests of the end user (owner) of the mobile device...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
- Autonomous space robots are needed for future missions such as satellite capture and large space structure construction. Precise control of these space robots is important for sp...