Buscar
Mostrando ítems 1-10 de 1980
Unsupervised instance selection from text streams
(Sociedade Brasileira de Computação - SBCPorto Alegre, 2014-02)
Instance selection techniques have received great attention in the literature, since they are very useful to identify a subset of instances (textual documents) that adequately represents the knowledge embedded in the entire ...
Controlling the number of active instances in a cloud environment
(Association for Computing Machinery, 2018-03)
We study a cloud environment in which computing instances may either be reserved in advance, or dynamically spawned to serve a fluctuating or unknown load. We first consider a centralized scheme where a system operator ...
Em torno da instância da imagem ao vivo
(São Paulo, 2009)
Este artigo procura resumir a hipótese da «instância da imagem ao vivo» a partir
da descrição da natureza do espaço público, entendido aqui como um ambiente
comunicacional, mais que institucional ou jurídico. A instância ...
Efficient descriptor tree growing for fast action recognition
(Elsevier Science, 2013-05)
Video and image classification based on Instance-to-Class (I2C) distance attracted many recent studies, due to the good generalization capabilities it provides for non-parametric classifiers. In this work we propose a ...
Solving a Large Real-world Bus Driver Scheduling Problem with a Multi-assignment based Heuristic Algorithm
(Graz Univ Technolgoy, Inst Information Systems Computer Media-iicm, 2017-01-01)
The bus driver scheduling problem (BDSP) under study consists in finding a set of duties that covers the bus schedule from a Brazilian public transportation bus company with the objective of minimizing the total cost. A ...
Solving a large real-world bus driver scheduling problem with a multi-assignment based heuristic algorithm
(2017-01-01)
The bus driver scheduling problem (BDSP) under study consists in finding a set of duties that covers the bus schedule from a Brazilian public transportation bus company with the objective of minimizing the total cost. A ...
Single-commodity robust network design problem: Complexity, instances and heuristic solutions
(ELSEVIER SCIENCE BV, 2014)
The minimization of open stacks problem: A review of some properties and their use in pre-processing operations
(Elsevier B.V., 2010-06-16)
Pre-processing operations that reduce the size of a problem may be decisive for solving or not solving practical instances of a NP-hard problem. In this article we review some properties suggested in the literature for the ...
Lower Bounds For Large Traveling Umpire Instances: New Valid Inequalities And A Branch-and-cut Algorithm
(PERGAMON-ELSEVIER SCIENCE LTDOXFORD, 2016)