Sciweavers

1725 search results - page 299 / 345
» Relaxed genetic programming
Sort
View
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
14 years 9 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
ICCAD
2009
IEEE
131views Hardware» more  ICCAD 2009»
14 years 7 months ago
Scheduling with soft constraints
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
Jason Cong, Bin Liu, Zhiru Zhang
ICSE
2011
IEEE-ACM
14 years 1 months ago
Always-available static and dynamic feedback
Developers who write code in a statically typed language are denied the ability to obtain dynamic feedback by executing their code during periods when it fails the static type che...
Michael Bayne, Richard Cook, Michael D. Ernst
CP
2003
Springer
15 years 3 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
BMCBI
2007
88views more  BMCBI 2007»
14 years 10 months ago
Use of DNA melting simulation software for in silico diagnostic assay design: targeting regions with complex melting curves and
Background: DNA melting curve analysis using double-stranded DNA-specific dyes such as SYTO9 produce complex and reproducible melting profiles, resulting in the detection of multi...
John P. Rasmussen, Christopher P. Saint, Paul T. M...