Sciweavers

287 search results - page 27 / 58
» An Algebraic Approach to Constraint Satisfaction Problems
Sort
View
IFM
2009
Springer
14 years 2 months ago
Verifying UML/OCL Operation Contracts
In current model-driven development approaches, software models are the primary artifacts of the development process. Therefore, assessment of their correctness is a key issue to e...
Jordi Cabot, Robert Clarisó, Daniel Riera
CP
2009
Springer
13 years 11 months ago
Constraint-Based Local Search for the Automatic Generation of Architectural Tests
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
Pascal Van Hentenryck, Carleton Coffrin, Boris Gut...
IAT
2008
IEEE
14 years 2 months ago
Competency-Based Intelligent Curriculum Sequencing: Comparing Two Evolutionary Approaches
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Although semiautomatic to...
Luis de Marcos, Roberto Barchino, José-Javi...
CSCLP
2006
Springer
13 years 11 months ago
An Attempt to Dynamically Break Symmetries in the Social Golfers Problem
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
Francisco Azevedo
ACMICEC
2006
ACM
89views ECommerce» more  ACMICEC 2006»
14 years 1 months ago
A semantic web approach to handling soft constraints in virtual organisations
In this paper we present a proposal for representing soft constraint satisfaction problems (CSPs) within the Semantic Web architecture. The proposal is motivated by the need for a...
Alun D. Preece, Stuart Chalmers, Craig McKenzie, J...