920 search results - page 77 / 184 » Generating Satisfiable Problem Instances |
FSTTCS
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
JCO
2008
13 years 10 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
CDC
2008
IEEE
14 years 5 months ago
2008
IEEE
Abstract— We analyze reachability properties and local input/output gains of systems with polynomial vector fields. Upper bounds for the reachable set and nonlinear system gains...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
: Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimizatio...
EAAI
2006
13 years 10 months ago
2006
This paper presents a feasibility study of evolutionary scheduling for gas pipeline operations. The problem is complex because of several constraints that must be taken into consi...