Sciweavers

8496 search results - page 223 / 1700
» Problem Solving and Complex Systems
Sort
View
CADE
2007
Springer
16 years 2 months ago
SRASS - A Semantic Relevance Axiom Selection System
This paper describes the design, implementation, and testing of a system for selecting necessary axioms from a large set also containing superfluous axioms, to obtain a proof of a...
Geoff Sutcliffe, Yury Puzis
IAT
2006
IEEE
15 years 8 months ago
A Multi-stage Graph Decomposition Algorithm for Distributed Constraint Optimisation
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
Terence H.-W. Law, Adrian R. Pearce
CP
2006
Springer
15 years 4 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
FM
1991
Springer
164views Formal Methods» more  FM 1991»
15 years 6 months ago
Formalizing Design Spaces: Implicit Invocation Mechanisms
An important goal of software engineering is to exploit commonalities in system design in order to reduce the complexity of building new systems, support largescale reuse, and pro...
David Garlan, David Notkin
KDD
1997
ACM
106views Data Mining» more  KDD 1997»
15 years 6 months ago
Clustering Sequences of Complex Objects
Sequential Data This paper is about the unsuperviseddiscovery of patterns in sequencesof compositeobjects. A compositeobject may be describedas a sequenceof other, simpler data. In...
A. Ketterlin