Sciweavers

14161 search results - page 359 / 2833
» On generalized middle-level problem
Sort
View
PPDP
2005
Springer
16 years 6 days ago
Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
Alessandro Dal Palù, Agostino Dovier, Enric...
MOR
2007
149views more  MOR 2007»
15 years 6 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
GPEM
2010
180views more  GPEM 2010»
15 years 5 months ago
Developments in Cartesian Genetic Programming: self-modifying CGP
Abstract Self-Modifying Cartesian Genetic Programming (SMCGP) is a general purpose, graph-based, developmental form of Genetic Programming founded on Cartesian Genetic Programming....
Simon Harding, Julian F. Miller, Wolfgang Banzhaf
JCO
2010
101views more  JCO 2010»
15 years 5 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
FIW
2009
120views Communications» more  FIW 2009»
15 years 4 months ago
Software Security Vulnerabilities Seen As Feature Interactions
The security of software applications is an important domain, and one that mixes formalisms (e.g. when dealing with cryptography and security protocols) with very ad hoc, low level...
Guy-Vincent Jourdan