Sciweavers

2414 search results - page 399 / 483
» Computing Normal Subgroups
Sort
View
JSAT
2006
126views more  JSAT 2006»
13 years 9 months ago
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
Sylvie Coste-Marquis, Daniel Le Berre, Florian Let...
KES
2006
Springer
13 years 9 months ago
Intelligent Environment for Training of Power Systems Operators
Training of operators has become an important problem to be faced by power systems: updating knowledge and skills. An operator must comprehend the physical operation of the process...
Gustavo Arroyo-Figueroa, Yasmín Herná...
ET
2007
89views more  ET 2007»
13 years 9 months ago
QCA Circuits for Robust Coplanar Crossing
In this paper, different circuits of Quantum-dot Cellular Automata (QCA) are proposed for the so-called coplanar crossing. Coplanar crossing is one of the most interesting feature...
Sanjukta Bhanja, Marco Ottavi, Fabrizio Lombardi, ...
MCS
2006
Springer
13 years 9 months ago
On the advantages of non-cooperative behavior in agent populations
We investigate the amount of cooperation between agents in a population during reward collection that is required to minimize the overall collection time. In our computer simulati...
Alexander Pudmenzky
PAMI
2008
195views more  PAMI 2008»
13 years 9 months ago
Robust Radiometric Calibration and Vignetting Correction
In many computer vision systems, it is assumed that the image brightness of a point directly reflects the scene radiance of the point. However, the assumption does not hold in mos...
Seon Joo Kim, Marc Pollefeys