920 search results - page 90 / 184 » Generating Satisfiable Problem Instances |
112
Voted
AMW
2009
14 years 10 months ago
2009
We address schema design in uncertain databases. Since uncertain data is relational in nature, decomposition becomes a key issue in design. Decomposition relies on dependency theo...
91
Voted
HAIS
2009
Springer
15 years 5 months ago
2009
Springer
This paper presents a hybrid evolutionary algorithm to tackle university course timetabling problems. The proposed approach is an extension of a non-linear great deluge algorithm i...
102
click to vote
NIPS
2000
15 years 2 months ago
2000
Bayesian networks are graphical representations of probability distributions. In virtually all of the work on learning these networks, the assumption is that we are presented with...
111
click to vote
TEC
2010
14 years 7 months ago
2010
In some expensive multiobjective optimization problems, several function evaluations can be carried out at one time. Therefore, it is very desirable to develop methods which can g...
113
click to vote
APN
2008
Springer
15 years 2 months ago
2008
Springer
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...