Sciweavers

4860 search results - page 165 / 972
» SNPs Problems, Complexity, and Algorithms
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...
UAI
2004
13 years 11 months ago
Dynamic Programming for Structured Continuous Markov Decision Problems
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
Zhengzhu Feng, Richard Dearden, Nicolas Meuleau, R...
EAAI
2007
90views more  EAAI 2007»
13 years 10 months ago
AI techniques in modelling, assignment, problem solving and optimization
This paper recapitulates the results of a long research on a family of artificial intelligence (AI) methods—relying on, e.g., artificial neural networks and search techniques...
Zsolt János Viharos, Zsolt Kemény
TVLSI
2008
90views more  TVLSI 2008»
13 years 10 months ago
A Special-Purpose Architecture for Solving the Breakpoint Median Problem
Abstract--In this paper, we describe the design for a co-processor for whole-genome phylogenetic reconstruction. Our current design performs a parallelized breakpoint median comput...
Jason D. Bakos, Panormitis E. Elenis
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...