Sciweavers

AAAI
2008
15 years 8 months ago
Optimal False-Name-Proof Voting Rules with Costly Voting
One way for agents to reach a joint decision is to vote over the alternatives. In open, anonymous settings such as the Internet, an agent can vote more than once without being det...
Liad Wagman, Vincent Conitzer
AAAI
2007
15 years 8 months ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
AAAI
2008
15 years 8 months ago
Artificial Intelligence Needs Open-Access Knowledgebase Contents
ar for abstract concepts, and a number of formally expressed, structural restrictions. Copyright c 2008, Association for the Advancement of Artificial Intelligence (www.aaai.org). ...
Erik Sandewall
AAAI
2008
15 years 8 months ago
Learning to Analyze Binary Computer Code
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
Nathan E. Rosenblum, Xiaojin Zhu, Barton P. Miller...
AAAI
2007
15 years 8 months ago
Model-lite Planning for the Web Age Masses: The Challenges of Planning with Incomplete and Evolving Domain Models
The automated planning community has traditionally focused on the efficient synthesis of plans given a complete domain theory. In the past several years, this line of work met wi...
Subbarao Kambhampati