Sciweavers

14649 search results - page 225 / 2930
» Principles of problem solving
Sort
View
AAIM
2007
Springer
116views Algorithms» more  AAIM 2007»
16 years 19 days ago
Solving Generalized Maximum Dispersion with Linear Programming
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
Gerold Jäger, Anand Srivastav, Katja Wolf
SAT
2007
Springer
73views Hardware» more  SAT 2007»
16 years 17 days ago
SAT Solving for Termination Analysis with Polynomial Interpretations
Abstract. Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most ...
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, ...
VTC
2006
IEEE
118views Communications» more  VTC 2006»
16 years 13 days ago
A Space-Time based Approach to Solving the Gain Asymmetry in MIMO ad hoc Networks
— The problem of gain asymmetry in MIMO ad-hoc networks is outlined and the solutions proposed in literature are surveyed. The protocol in [1] approach is analyzed and its delay ...
Francesco Rossetto, Michele Zorzi
ANOR
2008
171views more  ANOR 2008»
15 years 6 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
BMCBI
2008
211views more  BMCBI 2008»
15 years 6 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen