592 search results - page 68 / 119 » Analytical Tools for Natural Algorithms |
122
click to vote
EMSOFT
2005
Springer
15 years 7 months ago
2005
Springer
This paper is about the modular compilation and distribution of a sub-class of Simulink programs [9] across networks using bounded FIFO queues. The problem is first addressed mat...
111
click to vote
MLCW
2005
Springer
15 years 7 months ago
2005
Springer
Textual Entailment recognition is a very difficult task as it is one of the fundamental problems in any semantic theory of natural language. As in many other NLP tasks, Machine Lea...
108
click to vote
ECBS
2003
IEEE
15 years 6 months ago
2003
IEEE
We present an algebraic framework for evidence exploration: the process of interpreting, manipulating, and navigating the proof structure or evidence produced by a model checker w...
119
click to vote
LCN
2002
IEEE
15 years 6 months ago
2002
IEEE
We present a new method to estimate the Hurst parameter of the increment process in network traffic – a process that is assumed to be self-similar. The confidence intervals an...
111
click to vote
CAV
2001
Springer
15 years 6 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...