Sciweavers

3220 search results - page 481 / 644
» Constrained Graph Processes
Sort
View
ITC
1999
IEEE
107views Hardware» more  ITC 1999»
15 years 10 months ago
A high-level BIST synthesis method based on a region-wise heuristic for an integer linear programming
A high-level built-in self-test (BIST) synthesis involves several tasks such as system register assignment, interconnection assignment, and BIST register assignment. Existing high...
Han Bin Kim, Dong Sam Ha
ECP
1997
Springer
68views Robotics» more  ECP 1997»
15 years 10 months ago
Ignoring Irrelevant Facts and Operators in Plan Generation
It is traditional wisdom that one should start from the goals when generating a plan in order to focus the plan generation process on potentially relevant actions. The graphplan sy...
Bernhard Nebel, Yannis Dimopoulos, Jana Koehler
EMSOFT
2006
Springer
15 years 10 months ago
Efficient distributed deadlock avoidance with liveness guarantees
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
César Sánchez, Henny B. Sipma, Zohar...
UML
2000
Springer
15 years 10 months ago
Dynamic Meta Modeling: A Graphical Approach to the Operational Semantics of Behavioral Diagrams in UML
In this paper, dynamic meta modeling is proposed as a new approach to the operational semantics of behavioral UML diagrams. The dynamic meta model extends the well-known static met...
Gregor Engels, Jan Hendrik Hausmann, Reiko Heckel,...
DAGM
2008
Springer
15 years 8 months ago
A Multiple Kernel Learning Approach to Joint Multi-class Object Detection
Most current methods for multi-class object classification and localization work as independent 1-vs-rest classifiers. They decide whether and where an object is visible in an imag...
Christoph H. Lampert, Matthew B. Blaschko