1225 search results - page 40 / 245 » The Instance Complexity Conjecture |
MST
2008
13 years 9 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
IEAAIE
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. This paper has as main goal to develop a hybrid expert system to minimize some of the complexity problems related to arti cial intelligence eld. For instance, we can ment...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
ICDE
1999
IEEE
14 years 10 months ago
1999
IEEE
In this paper we study the node distribution of an Rtree storing region data, like for instance islands, lakes or human-inhabited areas. We will show that real region datasets are...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...