Sciweavers

3221 search results - page 227 / 645
» Termination of Linear Programs
Sort
View
SIAMJO
2011
15 years 24 days ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein
FASE
2009
Springer
16 years 1 months ago
Logical Testing
Abstract. Software is often tested with unit tests, in which each procedure is executed in isolation, and its result compared with an expected value. Individual tests correspond to...
Kathryn E. Gray, Alan Mycroft
ECOOP
2007
Springer
16 years 18 days ago
Exception Handling: A Field Study in Java and .NET
Most modern programming languages rely on exceptions for dealing with abnormal situations. Although exception handling was a significant improvement over other mechanisms like chec...
Bruno Cabral, Paulo Marques
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 18 days ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow
CSMR
2005
IEEE
16 years 2 days ago
A Comparison of Online and Dynamic Impact Analysis Algorithms
Impact analysis is the process of determining the effect, or impact, of a change to a software system. Dynamic impact analysis uses data obtained from executing a program to perfo...
Ben Breech, Mike Tegtmeyer, Lori L. Pollock