14774 search results - page 2573 / 2955 » Computational complexity and evolutionary computation |
196
click to vote
COMBINATORICS
2007
15 years 7 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
245
click to vote
IS
2008
15 years 7 months ago
2008
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
188
click to vote
COMCOM
2007
15 years 7 months ago
2007
Distributed Virtual Environment (DVE) systems have been designed last years as a set of distributed servers. These systems allow a large number of remote users to share a single 3...
244
click to vote
JAIR
2008
15 years 7 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
143
click to vote
IJON
2006
15 years 7 months ago
2006
Non-stationary signal classification is a complex problem. This problem becomes even more difficult if we add the following hypothesis: each signal includes a discriminant wavefor...