2542 search results - page 270 / 509 » Computing Cartograms with Optimal Complexity |
107
Voted
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
90
Voted
ASPDAC
2007
ACM
15 years 4 months ago
2007
ACM
Using multiple supply voltages on a SoC design is an efficient way to achieve low power. However, it may lead to a complex power network and a huge number of level shifters if we j...
117
click to vote
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...
123
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
In this work we present a new methodology for structure and parameter estimation in cell systems biology modelling. Our modelling framework is based on P systems, an unconl comput...
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...