136 search results - page 23 / 28 » Best practices in extreme programming course design |
PLDI
2004
ACM
15 years 3 months ago
2004
ACM
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
101
click to vote
BMCBI
2007
14 years 9 months ago
2007
Background: DNA microarray experiments are conducted in logical sets, such as time course profiling after a treatment is applied to the samples, or comparisons of the samples unde...
TASE
2008
IEEE
14 years 9 months ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...
ALGOSENSORS
2007
Springer
15 years 4 months ago
2007
Springer
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...