Sciweavers

769 search results - page 93 / 154
» Simple Composition of Nets
Sort
View
CVPR
1996
IEEE
14 years 1 months ago
Pattern Rejection
The e ciency of pattern recognition is particularly crucial in two scenarios; whenever there are a large number of classes to discriminate, and, whenever recognition must be perfo...
Simon Baker, Shree K. Nayar
CASCON
2007
110views Education» more  CASCON 2007»
13 years 10 months ago
Runtime monitoring of web service conversations
For a system of distributed processes, correctness can be ensured by (statically) checking whether their composition satisfies properties of interest. In contrast, Web services a...
Yuan Gan, Marsha Chechik, Shiva Nejati, Jon Bennet...
EC
2008
146views ECommerce» more  EC 2008»
13 years 9 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
FUIN
2008
123views more  FUIN 2008»
13 years 9 months ago
Interface Automata with Complex Actions: Limiting Interleaving in Interface Automata
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...
Shahram Esmaeilsabzali, Nancy A. Day, Farhad Mavad...
ALIFE
2005
13 years 9 months ago
Modular Interdependency in Complex Dynamical Systems
Hierarchical modularity is a familiar characteristic of a large class of natural dynamical systems. A normal interpretation of modularity is that interactions between subsystems a...
Richard A. Watson, Jordan B. Pollack