Sciweavers

1022 search results - page 116 / 205
» Logspace Complexity of Functions and Structures
Sort
View
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
15 years 4 months ago
Computing Weakest Strategies for Safety Games of Imperfect Information
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
Wouter Kuijper, Jaco van de Pol
ESAW
2009
Springer
15 years 4 months ago
Programming Organization-Aware Agents
Organizational notions such as roles, norms (e.g., obligations and permissions), and services are increasingly viewed as natural concepts to manage the complexity of software devel...
M. Birna van Riemsdijk, Koen V. Hindriks, Catholij...
ICMCS
2008
IEEE
151views Multimedia» more  ICMCS 2008»
15 years 4 months ago
Fast keyword detection with sparse time-frequency models
We address the problem of keyword spotting in continuous speech streams when training and testing conditions can be different. We propose a keyword spotting algorithm based on spa...
Effrosini Kokiopoulou, Pascal Frossard, Olivier Ve...
HICSS
2007
IEEE
103views Biometrics» more  HICSS 2007»
15 years 4 months ago
A Convolution Algorithm for Evaluating Supply Chain Delivery Performance
The effective management of a supply chain requires performance measures that accurately represent the underlying structure of the supply chain. Measures such as delivery performa...
Alfred L. Guiffrida, Robert A. Rzepka, Mohamad Y. ...
ICRA
2007
IEEE
162views Robotics» more  ICRA 2007»
15 years 4 months ago
Impedance Behaviors for Two-handed Manipulation: Design and Experiments
— The control of humanoid manipulators is very challenging due to the large number of degrees of freedom and the resulting redundancy. Using joint-level control complex planning ...
Thomas Wimböck, Christian Ott, Gerd Hirzinger