Sciweavers

870 search results - page 80 / 174
» Theoretical and experimental results on the goal-plan tree p...
Sort
View
TEC
2010
173views more  TEC 2010»
14 years 4 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao
FOCS
2000
IEEE
15 years 2 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
ICFEM
2009
Springer
14 years 7 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
IJCAI
2001
14 years 11 months ago
Active Learning for Structure in Bayesian Networks
The task of causal structure discovery from empirical data is a fundamental problem in many areas. Experimental data is crucial for accomplishing this task. However, experiments a...
Simon Tong, Daphne Koller
CIKM
2010
Springer
14 years 7 months ago
Combining link and content for collective active learning
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
Lixin Shi, Yuhang Zhao, Jie Tang