Sciweavers

9842 search results - page 160 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
SSPR
2010
Springer
13 years 8 months ago
Fast Population Game Dynamics for Dominant Sets and Other Quadratic Optimization Problems
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
Samuel Rota Bulò, Immanuel M. Bomze, Marcel...
IJDMB
2010
128views more  IJDMB 2010»
13 years 7 months ago
Computing approximate solutions of the protein structure determination problem using global constraints on discrete crystal latt
: Crystal lattices are discrete models of the three-dimensional space that have been effectively employed to facilitate the task of determining proteins' natural conformation....
Alessandro Dal Palù, Agostino Dovier, Enric...
CORR
2010
Springer
163views Education» more  CORR 2010»
13 years 7 months ago
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher ev...
Amir Ali Ahmadi, Alexander Olshevsky, Pablo A. Par...
ISMIS
1999
Springer
14 years 2 months ago
Applications and Research Problems of Subgroup Mining
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
Willi Klösgen
IWSAS
2000
Springer
14 years 1 months ago
Mapping an Application to a Control Architecture: Specification of the Problem
Abstract. This paper deals with self-adapting software that is structured according to a control theory architecture. Such software contains, in addition to its main function, two ...
Mieczyslaw M. Kokar, Kevin M. Passino, Kenneth Bac...