Sciweavers

601 search results - page 18 / 121
» CSP(M): Constraint Satisfaction Problem over Models
Sort
View
CCR
2004
90views more  CCR 2004»
14 years 9 months ago
A constraint satisfaction approach to testbed embedding services
Today's networking community is becoming increasingly skeptical of the significance of research results founded wholly upon experimental results conducted in simulation. Now, ...
Jeffrey Considine, John W. Byers, Ketan Meyer-Pate...
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
14 years 9 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
83
Voted
DSOM
2004
Springer
15 years 2 months ago
Using Object-Oriented Constraint Satisfaction for Automated Configuration Generation
In this paper, we describe an approach for automatically generating configurations for complex applications. Automated generation of system co nfigurations is required to allow lar...
Tim Hinrichs, Nathaniel Love, Charles J. Petrie, L...
91
Voted
EAAI
2008
104views more  EAAI 2008»
14 years 9 months ago
Feasible distributed CSP models for scheduling problems
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
Miguel A. Salido, Adriana Giret
ACG
2009
Springer
15 years 4 months ago
Monte-Carlo Kakuro
Abstract. Kakuro consists in filling a grid with integers that sum up to predefined values. Sums are predefined for each row and column and all integers have to be different in ...
Tristan Cazenave