920 search results - page 110 / 184 » Generating Satisfiable Problem Instances |
113
Voted
CSCLP
2004
Springer
15 years 8 months ago
2004
Springer
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
124
Voted
DOCENG
2005
ACM
15 years 4 months ago
2005
ACM
Structured document content reuse is the problem of restructuring and translating data structured under a source schema into an instance of a target schema. A notion closely tied ...
96
Voted
AAAI
2006
15 years 4 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
100
click to vote
IOR
2010
15 years 1 months ago
2010
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
116
Voted
TSMC
2011
14 years 9 months ago
2011
— Most state-based approaches to fault diagnosis of discrete-event systems require a complete and accurate model of the system to be diagnosed. In this paper, we address the prob...