4940 search results - page 189 / 988 » On the Complexity of Universal Programs |
157
click to vote
CALCO
2009
Springer
16 years 22 days ago
2009
Springer
The exactness properties of coproducts in extensive categories and pushouts along monos in adhesive categories have found various applications in theoretical computer science, e.g....
131
click to vote
ICRA
2006
IEEE
16 years 5 days ago
2006
IEEE
– We present a lab-based, student-taught robotics course at Carnegie Mellon University entitled Fun With Robots. The course does not require background knowledge of robotics, and...
155
click to vote
ATAL
2004
Springer
15 years 11 months ago
2004
Springer
The paper describes the architecture of Brown University’s agent, Botticelli, a finalist in the 2003 Trading Agent Competition in Supply Chain Management (TAC SCM). In TAC SCM,...
171
click to vote
ASM
2003
ASM
15 years 11 months ago
2003
ASM
d in Abstract State Machines – Advances in Theory and Applications: 10th International Workshop, ASM 2003, volume 2589 of LNCS, Springer–Verlag. Abstract Encryption and Protoco...
149
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...