185 search results - page 6 / 37 » Constructions of Grassmannian Simplices |
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Complex dialogs with comprehensive underlying data models are gaining increasing importance in today's Web applications. This in turn accelerates the need for highly dynamic ...
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion fo...
DLS
2005
15 years 1 days ago
2005
ContextL is an extension to the Common Lisp Object System that allows for Context-oriented Programming. It provides means to associate partial class and method definitions with l...
MFCS
1997
Springer
15 years 2 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
WOTUG
2008
14 years 11 months ago
2008
Abstract. The Santa Claus problem provides an excellent exercise in concurrent programming and can be used to show the simplicity or complexity of solving problems using a particul...