Sciweavers

1260 search results - page 23 / 252
» Bipolar Preference Problems
Sort
View
ISAAC
2003
Springer
210views Algorithms» more  ISAAC 2003»
14 years 3 months ago
The Student-Project Allocation Problem
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
David J. Abraham, Robert W. Irving, David Manlove
JAIR
2006
101views more  JAIR 2006»
13 years 9 months ago
Resource Allocation Among Agents with MDP-Induced Preferences
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
Dmitri A. Dolgov, Edmund H. Durfee
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
14 years 3 months ago
Multi-Agent Systems and Microeconomic Theory: A Negotiation Approach to Solve Scheduling Problems in High Dynamic Environments
Microeconomics offer a far developed theory on the subject of rational choice. This theory is applied to a multi-agent system, which has been modeled in order to establish schedul...
Hans Czap, Marc Becker
GD
2006
Springer
14 years 1 months ago
Parameterized st -Orientations of Graphs: Algorithms and Experiments
st-orientations (st-numberings) or bipolar orientations of undirected graphs are central to many graph algorithms and applications. Several algorithms have been proposed in the pas...
Charalampos Papamanthou, Ioannis G. Tollis
IS
2007
13 years 9 months ago
Semantic optimization techniques for preference queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
Jan Chomicki