2738 search results - page 152 / 548 » The Frobenius Problem and Its Generalizations |
136
click to vote
AIPS
2003
15 years 5 months ago
2003
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
131
click to vote
SAC
2004
ACM
15 years 10 months ago
2004
ACM
This paper presents an overview of our work, concerning a complete end-to-end framework for automatically generating message passing parallel code for tiled nested for-loops. It c...
123
Voted
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Multi-agent resource allocation is a growing area of research at the frontier between Economics and Computer Science. Despite the extensive theoretical work and raising number of ...
159
click to vote
MKM
2009
Springer
15 years 11 months ago
2009
Springer
Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many realworld systems and in formalised mathematics. Wh...
120
click to vote
PLDI
2004
ACM
15 years 10 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...