Sciweavers

1631 search results - page 115 / 327
» Observing Functional Logic Computations
Sort
View
COMPLEXITY
2006
91views more  COMPLEXITY 2006»
14 years 12 months ago
The evolution of technology within a simple computer model
Technology--the collection of devices and methods available to human society--evolves by constructing new devices and methods from ones that previously exist, and in turn offering...
W. Brian Arthur, Wolfgang Polak
AAAI
2008
15 years 2 months ago
Reducing Particle Filtering Complexity for 3D Motion Capture using Dynamic Bayesian Networks
Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distribu...
Cédric Rose, Jamal Saboune, François...
LICS
2007
IEEE
15 years 6 months ago
Limits of Multi-Discounted Markov Decision Processes
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. The payoff received by the controller can be evaluated in different ways, dep...
Hugo Gimbert, Wieslaw Zielonka
HPCA
2004
IEEE
16 years 8 days ago
Exploring Wakeup-Free Instruction Scheduling
Design of wakeup-free issue queues is becoming desirable due to the increasing complexity associated with broadcast-based instruction wakeup. The effectiveness of most wakeup-free...
Jie S. Hu, Narayanan Vijaykrishnan, Mary Jane Irwi...
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 4 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain