19130 search results - page 33 / 3826 » Modelling multi-path problems |
135
click to vote
CEEMAS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We are interested in understanding and simulating how humans elaborate plans in situations where knowledge is incomplete and how they interact to obtain missing informati...
119
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
134
click to vote
NETWORKS
2010
15 years 21 days ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
145
Voted
CPM
2004
Springer
15 years 7 months ago
2004
Springer
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
114
click to vote
EVOW
2004
Springer
15 years 7 months ago
2004
Springer
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...