Sciweavers

881 search results - page 22 / 177
» Solving satisfiability problems with preferences
Sort
View
ICALP
2010
Springer
14 years 1 months ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...
ICRA
2010
IEEE
114views Robotics» more  ICRA 2010»
13 years 7 months ago
A general information quality based approach for satisfying sensor constraints in multirobot tasks
— Many architectures have been proposed to solve tightly-coupled multirobot tasks (MT) through coalitions of heterogeneous robots. However, several issues remain unaddressed. As ...
Yu Zhang, Lynne E. Parker
ECAI
2010
Springer
13 years 9 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...
ICDM
2005
IEEE
134views Data Mining» more  ICDM 2005»
14 years 2 months ago
A Preference Model for Structured Supervised Learning Tasks
The preference model introduced in this paper gives a natural framework and a principled solution for a broad class of supervised learning problems with structured predictions, su...
Fabio Aiolli
JAIR
2006
101views more  JAIR 2006»
13 years 8 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