Sciweavers

5329 search results - page 163 / 1066
» The Weighted Majority Algorithm
Sort
View
124
Voted
ICALP
2003
Springer
15 years 7 months ago
Real-Time Scheduling with a Budget
We are given a set of jobs each has a processing time, a non-negative weight, a set of possible time intervals in which it can be processed and a cost. The goal is to schedule a f...
Joseph Naor, Hadas Shachnai, Tami Tamir
ALDT
2009
Springer
184views Algorithms» more  ALDT 2009»
15 years 7 months ago
Inverse Analysis from a Condorcet Robustness Denotation of Valued Outranking Relations
In this article we develop an indirect approach for assessing criteria significance weights from the robustness of the significance that a decision maker acknowledges for his pai...
Raymond Bisdorff, Patrick Meyer, Thomas Veneziano
ECML
2006
Springer
15 years 6 months ago
Graph Based Semi-supervised Learning with Sharper Edges
In many graph-based semi-supervised learning algorithms, edge weights are assumed to be fixed and determined by the data points' (often symmetric) relationships in input space...
Hyunjung Shin, N. Jeremy Hill, Gunnar Rätsch
114
Voted
RSA
2002
87views more  RSA 2002»
15 years 2 months ago
Inexpensive d-dimensional matchings
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz
139
Voted
AAAI
2012
13 years 5 months ago
Computing the Nucleolus of Matching, Cover and Clique Games
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
Ning Chen, Pinyan Lu, Hongyang Zhang