Sciweavers

920 search results - page 86 / 184
» Generating Satisfiable Problem Instances
Sort
View
96
Voted
ECAI
2010
Springer
15 years 1 months ago
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
Sylvain Bouveret, Ulle Endriss, Jérôm...
CLIMA
2010
15 years 26 days ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh
107
Voted
IS
2008
15 years 20 days ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
83
Voted
EWCBR
2008
Springer
15 years 2 months ago
Noticeably New: Case Reuse in Originality-Driven Tasks
"Similar problems have similar solutions" is a basic tenet of case-based inference. However this is not satisfied for CBR systems where the task is to achieve original so...
Belén Díaz-Agudo, Enric Plaza, Juan ...
191
Voted
PEPM
2009
ACM
17 years 24 days ago
Static Consistency Checking for Verilog Wire Interconnects
The Verilog hardware description language has padding semantics that allow designers to write descriptions where wires of different bit widths can be interconnected. However, many ...
Cherif Salama, Gregory Malecha, Walid Taha, Jim Gr...