Sciweavers

5863 search results - page 1045 / 1173
» On Model-Checking of P Systems
Sort
View
132
Voted
ATAL
2006
Springer
15 years 7 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
ATAL
2006
Springer
15 years 7 months ago
Specifying and resolving preferences among agent interaction patterns
A strength of commitment protocols is that they enable agents to act flexibly, thereby enabling them to accommodate varying local policies and respond to exceptions. A consequent ...
Ashok U. Mallya, Munindar P. Singh
ATAL
2006
Springer
15 years 7 months ago
Toward an understanding of the impact of software personal assistants on human organizations
Intelligent software personal assistants for human organizations are an active research area within the multiagent community. However, while many capabilities for these software p...
Steven Okamoto, Paul Scerri, Katia P. Sycara
BPM
2006
Springer
107views Business» more  BPM 2006»
15 years 7 months ago
On the Suitability of BPMN for Business Process Modelling
Abstract. In this paper we examine the suitability of the Business Process Modelling Notation (BPMN) for business process modelling, using the Workflow Patterns as an evaluation fr...
Petia Wohed, Wil M. P. van der Aalst, Marlon Dumas...
CAV
2006
Springer
141views Hardware» more  CAV 2006»
15 years 7 months ago
SMT Techniques for Fast Predicate Abstraction
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...
Shuvendu K. Lahiri, Robert Nieuwenhuis, Albert Oli...
« Prev « First page 1045 / 1173 Last » Next »