4940 search results - page 59 / 988 » On the Complexity of Universal Programs |
133
click to vote
JTAER
2006
15 years 4 months ago
2006
As universities seek to adopt increased e-business, e-commerce and e-learning initiates, the overall approach taken for security management within the organisation plays an increa...
126
click to vote
ORL
2006
15 years 4 months ago
2006
In this paper we derive estimates of the sample sizes required to solve a multistage stochastic programming problem with a given accuracy by the (conditional sampling) sample aver...
121
click to vote
IJCAI
2003
15 years 5 months ago
2003
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
124
click to vote
ECOOP
1998
Springer
15 years 8 months ago
1998
Springer
One of the price tags attached to the blessings that OO brings about is a drop in efficiency due to dynamic method dispatch. Much research effort is being spent on the problem of e...
125
click to vote
FUIN
2008
15 years 4 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...