2436 search results - page 193 / 488 » Comonadic Notions of Computation |
128
click to vote
TAPIA
2003
ACM
15 years 10 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 ...
125
click to vote
BIRTHDAY
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
140
click to vote
SBP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. There is much empirical evidence that human decisionmaking under risk does not correspond the decision-theoretic notion of “rational” decision making, namely to make ...
172
click to vote
AGP
2010
IEEE
15 years 9 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
116
click to vote
CA
2002
IEEE
15 years 9 months ago
2002
IEEE
One of the most important task in surgical simulation is the ability to cut volumetric organs. Several algorithms have already been described but none of them can actually maintai...