Sciweavers

16404 search results - page 518 / 3281
» A set coverage problem
Sort
View
MFCS
2009
Springer
16 years 1 months ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
CDC
2008
IEEE
126views Control Systems» more  CDC 2008»
16 years 1 months ago
Open and emerging control problems in tokamak plasma control
— The tokamak concept for magnetic confinement of fusion plasmas is now quite mature scientifically. This maturity is evidenced by the ongoing worldwide effort to design and cons...
M. L. Walker, Eugenio Schuster, Didier Mazon, Didi...
SBRN
2008
IEEE
16 years 1 months ago
Using a Probabilistic Neural Network for a Large Multi-label Problem
The automation of the categorization of economic activities from business descriptions in free text format is a huge challenge for the Brazilian governmental administration in the...
Elias Oliveira, Patrick Marques Ciarelli, Alberto ...
CSFW
2007
IEEE
16 years 1 months ago
The Insecurity Problem: Tackling Unbounded Data
In this paper we focus on tackling the insecurity problem of security protocols in the presence of an unbounded number of data such as nonces or session keys. First, we pinpoint f...
Sibylle B. Fröschle
CPAIOR
2007
Springer
16 years 1 months ago
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
J. M. van den Akker, Guido Diepen, J. A. Hoogeveen