Sciweavers

2354 search results - page 150 / 471
» Assignment Problems
Sort
View
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
15 years 6 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
AGENTS
1998
Springer
15 years 9 months ago
A Multiagent Perspective of Parallel and Distributed Machine Learning
Parallel and distributed information processing systems play an increasingly important role in artificial intelligence and computer science. In this article an approach to learnin...
Gerhard Weiß
168
Voted
NIPS
2008
15 years 6 months ago
Kernelized Sorting
Object matching is a fundamental operation in data analysis. It typically requires the definition of a similarity measure between the classes of objects to be matched. Instead, we...
Novi Quadrianto, Le Song, Alex J. Smola
123
Voted
CP
2005
Springer
15 years 10 months ago
Sub-optimality Approximations
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
Russell Bent, Irit Katriel, Pascal Van Hentenryck
154
Voted
ICAC
2005
IEEE
15 years 10 months ago
PICCIL: Interactive Learning to Support Log File Categorization
Motivated by the real-world application of categorizing system log messages into defined situation categories, this paper describes an interactive text categorization method, PICC...
David Loewenstern, Sheng Ma, Abdi Salahshour