Sciweavers

18306 search results - page 208 / 3662
» Algorithmics in Exponential Time
Sort
View
106
Voted
SYNTHESE
2008
114views more  SYNTHESE 2008»
15 years 2 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
CP
2010
Springer
15 years 1 months ago
Testing Expressibility Is Hard
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Ross Willard
CDC
2010
IEEE
145views Control Systems» more  CDC 2010»
14 years 9 months ago
Construction of Lyapunov functions for piecewise-deterministic Markov processes
The purpose of this contribution is twofold: 1) to present for the first time a Lyapunov function that proves exponential ergodicity of a process studied by the authors in [1], whe...
Alexandre R. Mesquita, João Pedro Hespanha
FCT
2001
Springer
15 years 7 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
SIMPAR
2010
97views Robotics» more  SIMPAR 2010»
15 years 11 days ago
A Parameterless Biologically Inspired Control Algorithm Robust to Nonlinearities, Dead-Times and Low-Pass Filtering Effects
A biologically inspired control algorithm for robot control was introduced in a previous work. The algorithm is robust to noisy sensor information and hardware failures. In this pa...
Fabio Dalla Libera, Shuhei Ikemoto, Takashi Minato...