3663 search results - page 154 / 733 » Problems in the ontology of computer programs |
163
click to vote
UPP
2004
Springer
15 years 3 months ago
2004
Springer
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
FCT
2007
Springer
15 years 4 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
IPPS
2006
IEEE
15 years 4 months ago
2006
IEEE
This paper explores the relation between the structured parallelism exposed by the Decomposable BSP (DBSP) model through submachine locality and locality of reference in multi-lev...
GI
1999
Springer
15 years 2 months ago
1999
Springer
We discuss the properties of strictly typed languages on the one hand and soft typing of the other and identify disadvantages of these approaches to type checking in the context of...