Sciweavers

AAAI
2006
14 years 29 days ago
The Complexity of Bribery in Elections
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
AAAI
2006
14 years 29 days ago
Machine Reading
Oren Etzioni, Michele Banko, Michael J. Cafarella
AAAI
2006
14 years 29 days ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
AAAI
2006
14 years 29 days ago
Anytime Induction of Decision Trees: An Iterative Improvement Approach
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
Saher Esmeir, Shaul Markovitch
AAAI
2006
14 years 29 days ago
CUI Networks: A Graphical Representation for Conditional Utility Independence
We introduce CUI networks, a compact graphical representation of utility functions over multiple attributes. CUI networks model multiattribute utility functions using the well stu...
Yagil Engel, Michael P. Wellman
AAAI
2006
14 years 29 days ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams
AAAI
2006
14 years 29 days ago
Forgetting and Conflict Resolving in Disjunctive Logic Programming
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
Thomas Eiter, Kewen Wang
AAAI
2006
14 years 29 days ago
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
Robert T. Effinger, Brian C. Williams
AAAI
2006
14 years 29 days ago
LOCATE Intelligent Systems Demonstration: Adapting Help to the Cognitive Styles of Users
LOCATE is workspace layout design software that also serves as a testbed for developing and refining principles of adaptive aiding. This demonstration illustrates LOCATE's ab...
Jack L. Edwards, Greg Scott
AAAI
2006
14 years 29 days ago
Cost-Optimal External Planning
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
Stefan Edelkamp, Shahid Jabbar