383 search results - page 72 / 77 » A new infeasible interior-point algorithm for linear program... |
109
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
150
Voted
WWW
2005
ACM
16 years 4 months ago
2005
ACM
Message hierarchies in web discussion boards grow with new postings. Threads of messages evolve as new postings focus within or diverge from the original themes of the threads. Th...
134
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
134
Voted
ANOR
2005
15 years 3 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
145
Voted
VLSISP
2002
15 years 3 months ago
2002
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...