Sciweavers

8413 search results - page 265 / 1683
» Ordering Problem Subgoals
Sort
View
JUCS
2002
89views more  JUCS 2002»
15 years 2 months ago
Scheduling Tasks to a Team of Autonomous Mobile Service Robots in Indoor Enviroments
Abstract: This paper presents a complete system for scheduling transportation orders to a fleet of autonomous mobile robots in service environments. It consists of the autonomous m...
Hartmut Surmann, Antonio Morales
AIPS
2006
15 years 4 months ago
Tractable Optimal Competitive Scheduling
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
Jeremy Frank, James Crawford, Lina Khatib, Ronen I...
FSTTCS
2000
Springer
15 years 6 months ago
Text Sparsification via Local Maxima
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Gr...
AI
2001
Springer
15 years 7 months ago
Concept-Learning in the Presence of Between-Class and Within-Class Imbalances
In a concept learning problem, imbalances in the distribution of the data can occur either between the two classes or within a single class. Yet, although both types of imbalances ...
Nathalie Japkowicz
CP
2009
Springer
16 years 3 months ago
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency
The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency...
Meinolf Sellmann