Sciweavers

4047 search results - page 401 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
RTSS
2008
IEEE
16 years 1 months ago
Symbolic Computation of Schedulability Regions Using Parametric Timed Automata
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
Alessandro Cimatti, Luigi Palopoli, Yusi Ramadian
IROS
2007
IEEE
164views Robotics» more  IROS 2007»
16 years 1 months ago
Analysis of indeterminate contact forces in robotic grasping and contact tasks
— In this paper, we analyze indeterminate contact forces in robotic grasping and contact tasks. Previous studies by Omata and Nagata showed that there is a constraint on static f...
Yusuke Maeda, Koutarou Oda, Satoshi Makita
CICLING
2007
Springer
16 years 26 days ago
Handling Conjunctions in Named Entities
Although the literature contains reports of very high accuracy figures for the recognition of named entities in text, there are still some named entity phenomena that remain probl...
Robert Dale, Pawel P. Mazur
RTA
2005
Springer
16 years 5 days ago
Proving Positive Almost-Sure Termination
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Olivier Bournez, Florent Garnier
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
16 years 2 days ago
Analysis and Improvements of the Adaptive Discretization Intervals Knowledge Representation
In order to handle classification problems with real-valued attributes using discretization algorithms it is necessary to obtain a good and reduced set of cut points in order to l...
Jaume Bacardit, Josep Maria Garrell i Guiu