2588 search results - page 40 / 518 » Applications of Kolmogorov complexity to computable model th... |
CIKM
1997
Springer
15 years 3 months ago
1997
Springer
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
15 years 6 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
104
click to vote
ICRA
2010
IEEE
14 years 9 months ago
2010
IEEE
— Game theoretical approaches have been recently used to develop patrolling strategies for mobile robots. The idea is that the patroller and the intruder play a game, whose outco...
DALT
2005
Springer
15 years 4 months ago
2005
Springer
Existing cognitive agent programming languages that are based on the BDI model employ logical representation and reasoning for implementing the beliefs of agents. In these programm...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
—In this paper we discuss the use of cooperative game theory for analyzing interference channels. We extend our previous work, to games with N players as well as frequency select...