Sciweavers

3937 search results - page 384 / 788
» Questioning Ubiquitous Computing
Sort
View
161
Voted
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 3 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
ATAL
2003
Springer
15 years 11 months ago
Capturing agent autonomy in roles and XML
A key question in the field of agent-oriented software engineering is how the kind and extent of autonomy owned by computational agents can be appropriately captured. As long as ...
Gerhard Weiß, Michael Rovatsos, Matthias Nic...
CHI
1997
ACM
15 years 10 months ago
Rosebud: Technological Toys for Storytelling
Rosebud is a user-interface prototype which elicits storytelling by child users though interaction with a computationally-augmented physical artifact. In particular, Rosebud links...
Jennifer W. Glos, Justine Cassell
AB
2008
Springer
16 years 21 days ago
Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology
Abstract. Symbolic methods for investigating Hopf bifurcation problems of vector fields arising in the context of algebraic biology have recently obtained renewed attention. Howev...
Thomas Sturm, Andreas Weber 0004
CSR
2007
Springer
16 years 15 days ago
Inverting Onto Functions and Polynomial Hierarchy
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially verifiable and guaranteed to exist. Do we have evidence ...
Harry Buhrman, Lance Fortnow, Michal Koucký...