3047 search results - page 549 / 610 » On the Meaning of Logical Completeness |
FSTTCS
2007
Springer
15 years 3 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
ACSAC
2006
IEEE
15 years 3 months ago
2006
IEEE
With the recent advent of dynamically extensible software systems, in which software extensions may be dynamically loaded into the address space of a core application to augment i...
DFT
2006
IEEE
15 years 3 months ago
2006
IEEE
Control flow checking (CFC) is a well known concurrent checking technique for ensuring that a program’s instruction execution sequence follows permissible paths. Almost all CFC...
ITICSE
2006
ACM
15 years 3 months ago
2006
ACM
Identifying and managing students who experience difficulty with learning to program is a challenge for CS educators. In an attempt to answer the familiar question “What makes f...