3663 search results - page 202 / 733 » Problems in the ontology of computer programs |
162
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...
148
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Straight-line programs (SLPs) offer powerful text compression by representing a text T[1, u] in terms of a restricted context-free grammar of n rules, so that T can be r...
192
click to vote
IEEESCC
2005
IEEE
16 years 5 days ago
2005
IEEE
This paper presents Abacus, a service-oriented programming language designed for the development of grid applications. Abacus considers that all the grid resources constitute a un...
183
click to vote
SPIN
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
163
click to vote
TAPIA
2003
ACM
15 years 11 months ago
2003
ACM
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...