Sciweavers

3204 search results - page 260 / 641
» The b-chromatic Number of a Graph
Sort
View
99
Voted
DAM
2007
100views more  DAM 2007»
15 years 22 days ago
Memory management optimization problems for integrated circuit simulators
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
Timothée Bossart, Alix Munier Kordon, Franc...
JEC
2006
61views more  JEC 2006»
15 years 22 days ago
Time-constrained loop scheduling with minimal resources
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
TCS
2008
15 years 20 days ago
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
Anne Berry, Elias Dahlhaus, Pinar Heggernes, Genev...
JCT
2007
111views more  JCT 2007»
15 years 19 days ago
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
David Forge, Thomas Zaslavsky
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 7 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...