918 search results - page 47 / 184 » e-Procurement Using Goal Programming |
127
click to vote
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
105
click to vote
BIRTHDAY
1994
Springer
15 years 6 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
130
click to vote
COOPIS
2004
IEEE
15 years 5 months ago
2004
IEEE
This paper describes TRAP/J, a software tool that enables new adaptable behavior to be added to existing Java applications transparently (that is, without modifying the application...
122
click to vote
ICLP
2005
Springer
15 years 7 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
246
click to vote
ICLP
2009
Springer
16 years 2 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...