Sciweavers

635 search results - page 15 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
ECAI
2010
Springer
14 years 10 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...

Lecture Notes
443views
16 years 7 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
ICML
2010
IEEE
14 years 9 months ago
A DC Programming Approach for Sparse Eigenvalue Problem
We investigate the sparse eigenvalue problem which arises in various fields such as machine learning and statistics. Unlike standard approaches relying on approximation of the l0n...
Mamadou Thiao, Pham Dinh Tao, Le Thi Hoai An
DIAGRAMS
2008
Springer
14 years 11 months ago
Enhancing State-Space Tree Diagrams for Collaborative Problem Solving
State-space search methods in problem solving have often been illustrated using tree diagrams. We explore a set of issues related to coordination in collaborative problem solving a...
Steven L. Tanimoto
HEURISTICS
2007
165views more  HEURISTICS 2007»
14 years 9 months ago
New heuristics for the maximum diversity problem
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
Geiza C. Silva, Marcos R. Q. de Andrade, Luiz Sato...