1204 search results - page 168 / 241 » Termination of Polynomial Programs |
NETWORKS
2010
14 years 8 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
AI
2011
Springer
14 years 4 months ago
2011
Springer
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
108
click to vote
AGTIVE
2003
Springer
15 years 3 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
HYBRID
2001
Springer
15 years 2 months ago
2001
Springer
It has been observed that there are a variety of situations in which the most popular hybrid simulation methods can fail to properly detect the occurrence of discrete events. In th...
ESOP
2009
Springer
15 years 4 months ago
2009
Springer
Tools for analysing secure information flow are almost exclusively based on ideas going back to Denning’s work from the 70’s. This approach embodies an imperfect notion of sec...