Sciweavers

2038 search results - page 101 / 408
» Loops under Strategies
Sort
View
PLILP
1993
Springer
14 years 2 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
ROBOTICA
2006
116views more  ROBOTICA 2006»
13 years 10 months ago
Hybrid velocity/force control for robot navigation in compliant unknown environments
We combine a "hybrid" force/position control scheme with a potential field approach into a novel method for collision recovery and navigation in unknown environments. It...
Dushyant Palejiya, Herbert G. Tanner
SP
2008
IEEE
117views Security Privacy» more  SP 2008»
14 years 4 months ago
Anonymous Networking with Minimum Latency in Multihop Networks
The problem of security against timing based traffic analysis in multihop networks is considered in this work. In particular, the relationship between the level of anonymity prov...
Parvathinathan Venkitasubramaniam, Lang Tong
CDC
2009
IEEE
169views Control Systems» more  CDC 2009»
14 years 2 months ago
Parametric regret in uncertain Markov decision processes
— We consider decision making in a Markovian setup where the reward parameters are not known in advance. Our performance criterion is the gap between the performance of the best ...
Huan Xu, Shie Mannor
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
14 years 3 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm