Sciweavers

9049 search results - page 306 / 1810
» The New C Standard
Sort
View
180
Voted
GTTSE
2007
Springer
16 years 1 months ago
Model Transformations for the Compilation of Multi-processor Systems-on-Chip
With the increase of amount of transistors which can be contained on a chip and the constant expectation for more sophisticated applications, the design of Systems-on-Chip (SoC) is...
Éric Piel, Philippe Marquet, Jean-Luc Dekey...
219
Voted
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
16 years 9 days ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
WSC
1998
15 years 8 months ago
Communication Mission-type Orders to Virtual Commanders
This paper discusses issues in modeling C4I and cognitive processes in next generation simulations and applications to Force XXI command and control. We propose a modification to ...
Martin S. Kleiner, Scott A. Carey, Joseph E. Beach
ETS
2006
IEEE
108views Hardware» more  ETS 2006»
16 years 1 months ago
A DFT Architecture for Asynchronous Networks-on-Chip
The Networks-on-Chip (NoCs) paradigm is emerging as a solution for the communication of SoCs. Many NoC architecture propositions are presented but few works on testing these netwo...
Xuan-Tu Tran, Jean Durupt, François Bertran...
FOCS
2002
IEEE
16 years 13 days ago
The Hardness of 3 - Uniform Hypergraph Coloring
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
Irit Dinur, Oded Regev, Clifford D. Smyth