Sciweavers

1984 search results - page 212 / 397
» The colourful feasibility problem
Sort
View
CCE
2005
15 years 6 months ago
Synthesis of separation processes by case-based reasoning
A new approach to separation process synthesis and selection of single separations is presented. The method is based on the reuse of existing design cases by case-based reasoning ...
Timo Seuranen, Markku Hurme, Elina Pajula
JOLLI
2007
128views more  JOLLI 2007»
15 years 6 months ago
Linear temporal logic as an executable semantics for planning languages
This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easy-to-use planning language is described, PDDL-K (Planning...
Marta Cialdea Mayer, Carla Limongelli, Andrea Orla...
ECCC
2000
113views more  ECCC 2000»
15 years 6 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich
JSA
2000
96views more  JSA 2000»
15 years 6 months ago
Schedulability analysis of periodic and aperiodic tasks with resource constraints
In this paper, we address the problem of scheduling hybrid task sets consisting of hard periodic and soft aperiodic tasks that may share resources in exclusive mode in a dynamic e...
Giuseppe Lipari, Giorgio C. Buttazzo
CORR
1998
Springer
117views Education» more  CORR 1998»
15 years 6 months ago
A Human - machine interface for teleoperation of arm manipulators in a complex environment
This paper discusses the feasibility of using conguration space C-space as a means of visualization and control in operator-guided real-time motion of a robot arm manipulator. T...
Igor Ivanisevic, Vladimir J. Lumelsky