6598 search results - page 309 / 1320 » Graph Theory with Applications |
167
click to vote
ECEASST
2008
15 years 6 months ago
2008
: This paper introduces negative application conditions for reconfigurable place/transition nets. These are Petri nets together with a set of rules that allow changing the net and ...
191
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
Abstract: In this paper, we present an interprocessor communication-aware task scheduling algorithm applicable to a multiprocessor system executing an application with dependent ta...
325
click to vote
Book
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...
176
click to vote
EUSFLAT
2009
15 years 4 months ago
2009
Abstract: We consider application of Zadeh's impossibility principle and extended logic FLe to approximate scientific explanation from the standpoint of the philosophy of scie...
184
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...