Sciweavers

2244 search results - page 311 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
GCB
2000
Springer
137views Biometrics» more  GCB 2000»
15 years 10 months ago
Detecting Sporadic Recombination in DNA Alignments with Hidden Markov Models
Conventional phylogenetic tree estimation methods assume that all sites in a DNA multiple alignment have the same evolutionary history. This assumption is violated in data sets fro...
Dirk Husmeier, Frank Wright
EOR
2008
87views more  EOR 2008»
15 years 6 months ago
Robust surgery loading
We consider the robust surgery loading problem for a hospital's operating theatre department, which concerns assigning surgeries and sufficient planned slack to operating roo...
Erwin W. Hans, Gerhard Wullink, Mark van Houdenhov...
SASO
2009
IEEE
16 years 1 months ago
Evolution of Probabilistic Consensus in Digital Organisms
—The complexity of distributed computing systems and their increasing interaction with the physical world impose challenging requirements in terms of adaptation, robustness, and ...
David B. Knoester, Philip K. McKinley
HICSS
2007
IEEE
212views Biometrics» more  HICSS 2007»
16 years 21 days ago
Fully-automatic generation of user interfaces for multiple devices from a high-level model based on communicative acts
The problems involved in the development of user interfaces become even more severe through the ubiquitous use of a variety of devices such as PCs, mobile phones and PDAs. Each of...
Jürgen Falb, Roman Popp, Thomas Röck, He...
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
15 years 10 months ago
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
Christian Ernst, Changxing Dong, Gerold Jäger...