Sciweavers

2735 search results - page 482 / 547
» Comparing notions of randomness
Sort
View
IANDC
2007
107views more  IANDC 2007»
13 years 9 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
TCS
2008
13 years 9 months ago
Absolute versus probabilistic classification in a logical setting
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
Sanjay Jain, Eric Martin, Frank Stephan
JACM
2007
84views more  JACM 2007»
13 years 9 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
BMCBI
2004
138views more  BMCBI 2004»
13 years 9 months ago
Constraint Logic Programming approach to protein structure prediction
Background: The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information ...
Alessandro Dal Palù, Agostino Dovier, Feder...
JIRS
1998
100views more  JIRS 1998»
13 years 9 months ago
Reactive Robots in the Service of Production Management
In this paper, we advocate the use of reactive robots in industrial process control and production management. It is explained why reactive robots are well-suited to modern industr...
Elpida Tzafestas