1379 search results - page 223 / 276 » The Complexity of the Annihilating Polynomial |
168
click to vote
NMR
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...
202
click to vote
SCOPES
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
134
click to vote
STACS
2004
Springer
15 years 11 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
139
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
135
click to vote
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...