An important problem in analyzing complex networks is discovery of modular or community structures embedded in the networks. Although being promising for identifying network commu...
We create a unified framework for analyzing and synthesizing plans with loops for solving problems with nondeterministic numeric effects and a limited form of partial observabili...
ion for Solving Large Incomplete-Information Games Tuomas Sandholm Computer Science Department Carnegie Mellon University Most real-world games and many recreational games are gam...
The interactions between covariates may change with learning domains. Discovering such transitions may offer key information helping us transfer our knowledge from one domain to a...
The development and maintenance of large and complex ontologies are often time-consuming and error-prone. Thus, automated ontology learning and evolution have attracted intensive ...
We study convergence properties of iterative voting procedures. Such a procedure is defined by a voting rule and a (restricted) iterative process, where at each step one agent ca...
Svetlana Obraztsova, Evangelos Markakis, Maria Pol...
A scoring rule is a device for eliciting and assessing probabilistic forecasts from an agent. When dealing with continuous outcome spaces, and absent any prior insights into the s...
Optimization via continuation method is a widely used approach for solving nonconvex minimization problems. While this method generally does not provide a global minimum, empirica...