Sciweavers

2778 search results - page 180 / 556
» Limit complexities revisited
Sort
View
AAAI
2006
15 years 8 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
CSREASAM
2006
15 years 8 months ago
A Visual Environment for Characterization of State Changes in Computer Systems
: Traditional state modeling techniques have several limitations. One of these is the reduced ability to model a large number of variables simultaneously. Another limitation is tha...
Gregory Vert, Sergiu M. Dascalu, Frederick C. Harr...
IADIS
2004
15 years 8 months ago
Designing a personalized E-learning experience using learning objects
This paper aims to provide an experimental vision of the process of course creation using learning objects obtained in the <e-aula> project, a pilot e-learning system concei...
Pilar Sancho, Borja Manero, Baltasar Fernán...
AAAI
1990
15 years 7 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
ECRTS
2010
IEEE
15 years 7 months ago
Preemption Points Placement for Sporadic Task Sets
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
Marko Bertogna, Giorgio C. Buttazzo, Mauro Marinon...