3663 search results - page 179 / 733 » Problems in the ontology of computer programs |
199
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
162
click to vote
SAGT
2010
Springer
15 years 4 months ago
2010
Springer
Recent results showing PPAD-completeness of the problem of computing an equilibrium for Fisher’s market model under additively separable, piecewise-linear, concave utilities (pl...
144
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
187
click to vote
BIRTHDAY
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This case study applies techniques of formal program development by specification refinement and composition to the problem of concurrent garbage collection. The speci...
160
click to vote
COMPSAC
2000
IEEE
15 years 11 months ago
2000
IEEE
Genetic programming tackles the issue of how to automatically create a working computer program for a given problem from some initial problem statement. The goal is accomplished i...