Sciweavers

2465 search results - page 171 / 493
» Automata on Linear Orderings
Sort
View
BIRTHDAY
2005
Springer
14 years 3 months ago
Reduction Strategies for Left-Linear Term Rewriting Systems
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
Yoshihito Toyama
ICRA
1998
IEEE
106views Robotics» more  ICRA 1998»
14 years 2 months ago
Learning a Linear Association of Drilling Profiles in Stapedotomy Surgery
The two-level fuzzy-lattice (2L-FL) learning scheme is introduced for application on an intelligent surgical (mechatronic) drill in the stapedotomy surgical procedure in the ear. ...
Vassilis G. Kaburlasos, Vassilios Petridis, Peter ...
IPPS
2005
IEEE
14 years 4 months ago
Parallelization of Direct Algorithms using Multisplitting Methods in Grid Environments
The goal of this paper is to introduce a new approach to the building of efficient distributed linear system solvers. The starting point of the results of this paper lies in the ...
Jacques M. Bahi, Raphaël Couturier
CSL
2007
Springer
14 years 4 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
IJCAI
1989
13 years 11 months ago
Towards a Theory of Conflict Detection and Resolution in Nonlinear Plans
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...
Joachim Hertzberg, Alexander Horz