Sciweavers

11565 search results - page 1959 / 2313
» Computing Minimal Mappings
Sort
View
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 10 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 10 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
ASWSD
2006
Springer
15 years 10 months ago
Generating Sound and Resource-Aware Code from Hybrid Systems Models
Modern real-time embedded systems are complex, distributed, feature-rich applications. Model-based development of real-time embedded systems promises to simplify and accelerate the...
Madhukar Anand, Sebastian Fischmeister, Jesung Kim...
ECAI
2006
Springer
15 years 10 months ago
Coalition Structure Generation in Task-Based Settings
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multi-agent system...
Viet Dung Dang, Nicholas R. Jennings
157
Voted
ECML
2006
Springer
15 years 10 months ago
Cost-Sensitive Decision Tree Learning for Forensic Classification
Abstract. In some learning settings, the cost of acquiring features for classification must be paid up front, before the classifier is evaluated. In this paper, we introduce the fo...
Jason V. Davis, Jungwoo Ha, Christopher J. Rossbac...
« Prev « First page 1959 / 2313 Last » Next »