Sciweavers

513 search results - page 94 / 103
» Finitely Based, Finite Sets of Words
Sort
View
AI
2006
Springer
14 years 11 months ago
Robot introspection through learned hidden Markov models
In this paper we describe a machine learning approach for acquiring a model of a robot behaviour from raw sensor data. We are interested in automating the acquisition of behaviour...
Maria Fox, Malik Ghallab, Guillaume Infantes, Dere...
JUCS
2008
120views more  JUCS 2008»
14 years 11 months ago
Guaranteeing Seamless Mobility with User Redials and Automatic Handover Retrials
: In communication systems that guarantee seamless mobility of users across service areas, repeated attempts occur as a result of user behavior but also as automatic retries of blo...
José Manuel Giménez-Guzmán, M...
SIAMJO
2010
136views more  SIAMJO 2010»
14 years 6 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
ECCC
2010
83views more  ECCC 2010»
14 years 9 months ago
Symmetric LDPC codes are not necessarily locally testable
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...
TROB
2002
169views more  TROB 2002»
14 years 11 months ago
Constructing reconfigurable software for machine control systems
Reconfigurable software is highly desired for automated machine tool control systems for low-cost products and short time to market. In this paper, we propose a software architectu...
Shige Wang, Kang G. Shin