Sciweavers

9842 search results - page 1496 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
CDC
2009
IEEE
113views Control Systems» more  CDC 2009»
15 years 11 months ago
Computation of safety control for uncertain piecewise continuous systems on a partial order
— In this paper, the safety control problem for a class of hybrid systems with disturbance inputs and imperfect continuous state information is considered. Under the assumption t...
Michael R. Hafner, Domitilla Del Vecchio
CEC
2009
IEEE
15 years 11 months ago
A parallel genetic algorithm for protein folding prediction using the 3D-HP Side Chain model
— This work presents a methodology for the application of a parallel genetic algorithm (PGA) to the problem of protein folding prediction, using the 3DHP-Side Chain model. This m...
César Manuel Vargas Benítez, Heitor ...
LATA
2009
Springer
15 years 11 months ago
Nested Counters in Bit-Parallel String Matching
Many algorithms, e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism...
Kimmo Fredriksson, Szymon Grabowski
MCS
2009
Springer
15 years 11 months ago
An Empirical Study of a Linear Regression Combiner on Multi-class Data Sets
The meta-learner MLR (Multi-response Linear Regression) has been proposed as a trainable combiner for fusing heterogeneous baselevel classifiers. Although it has interesting prope...
Chun-Xia Zhang, Robert P. W. Duin
AGENTS
2001
Springer
15 years 11 months ago
ATTac-2000: an adaptive autonomous bidding agent
The First Trading Agent Competition TAC was held from June 22nd to July 8th, 2000. TAC was designed to create a benchmark problem in the complex domain of emarketplaces and to m...
Peter Stone, Michael L. Littman, Satinder P. Singh...
« Prev « First page 1496 / 1969 Last » Next »