193 search results - page 38 / 39 » Incremental logic rectification |
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
ATVA
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...
AAAI
2010
13 years 9 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Agent-based simulations are an increasingly popular means of exploring and understanding complex social systems. In order to be useful, these simulations must capture a range of a...