1029 search results - page 27 / 206 » An Architecture for Problem Solving with Diagrams |
ATAL
1997
Springer
15 years 1 months ago
1997
Springer
Abstract. This paper presents a general multi-agent architecture for the management of businessprocesses,and an agent designthat has been implemented within such a system. The auto...
DAC
2002
ACM
15 years 10 months ago
2002
ACM
Research in algorithms for Boolean satisfiability and their efficient implementations [26, 8] has recently outpaced benchmarking efforts. Most of the classic DIMACS benchmarks fro...
DAC
2008
ACM
15 years 10 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
ENTCS
2008
14 years 9 months ago
2008
In a UML model, different aspects of a system are covered by different types of diagrams and this bears the risk that an overall system specification becomes barely tractable by t...
104
click to vote
ICPADS
2007
IEEE
15 years 3 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...