Sciweavers

1458 search results - page 50 / 292
» The sequentially realizable functionals
Sort
View
83
Voted
MLQ
1998
61views more  MLQ 1998»
15 years 2 months ago
Extracting Algorithms from Intuitionistic Proofs
This paper presents a new method – which does not rely on the cut-elimination theorem – for characterizing the provably total functions of certain intuitionistic subsystems of ...
Fernando Ferreira, António Marques
114
Voted
ECOWS
2006
Springer
15 years 4 months ago
Parallel Web Service Composition in MoSCoE: A Choreography-Based Approach
We present a goal-driven approach to model a choreographer for realizing composite Web services. In this framework, the users start with an abstract, and possibly incomplete funct...
Jyotishman Pathak, Samik Basu, Robyn R. Lutz, Vasa...
ICPR
2006
IEEE
16 years 3 months ago
An integrated Monte Carlo data association framework for multi-object tracking
We propose a sequential Monte Carlo data association algorithm based on a two-level computational framework for tracking varying number of interacting objects in dynamic scene. Fi...
Jianru Xue, Nanning Zheng, Xiaopin Zhong
108
Voted
DATE
2006
IEEE
88views Hardware» more  DATE 2006»
15 years 8 months ago
Using conjugate symmetries to enhance gate-level simulations
State machine based simulation of Boolean functions is substantially faster if the function being simulated is symmetric. Unfortunately function symmetries are comparatively rare....
Peter M. Maurer
JAIR
2008
126views more  JAIR 2008»
15 years 2 months ago
Optimal and Approximate Q-value Functions for Decentralized POMDPs
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
Frans A. Oliehoek, Matthijs T. J. Spaan, Nikos A. ...