Sciweavers

246 search results - page 19 / 50
» Dynamic Local Search for the Maximum Clique Problem
Sort
View
MOBISYS
2006
ACM
15 years 9 months ago
ARIADNE: a dynamic indoor signal map construction and localization system
Location determination of mobile users within a building has attracted much attention lately due to its many applications in mobile networking including network intrusion detectio...
Yiming Ji, Saad Biaz, Santosh Pandey, Prathima Agr...
85
Voted
AAAI
2006
14 years 11 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
NN
2002
Springer
136views Neural Networks» more  NN 2002»
14 years 9 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
CEC
2009
IEEE
15 years 4 months ago
A clustering particle swarm optimizer for dynamic optimization
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...
Changhe Li, Shengxiang Yang
PATAT
2004
Springer
148views Education» more  PATAT 2004»
15 years 3 months ago
Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming
Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools...
Hadrien Cambazard, Fabien Demazeau, Narendra Jussi...