Sciweavers

3211 search results - page 463 / 643
» On the Grundy Number of a Graph
Sort
View
LION
2007
Springer
138views Optimization» more  LION 2007»
16 years 18 days ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
ETFA
2006
IEEE
16 years 16 days ago
Synthesis of Distributed Controllers by Means of a Monolithic Approach
Abstract. In this paper, reverse partially-marked safe net condition/event systems (RsNCES) are introduced, rules of their functioning are defined and convenient interpretation met...
Dirk Missal, Hans-Michael Hanisch
ICMCS
2006
IEEE
125views Multimedia» more  ICMCS 2006»
16 years 15 days ago
Modeling Adaptive Media Processing Workflows
ARIA, ARchitecture for Interactive Arts, is a middleware to process, filter, and fuse sensory inputs and actuate responses in real-time. An ARIA media processing workflow descri...
K. Selçuk Candan, Gisik Kwon, Lina Peng, Ma...
ASPDAC
2006
ACM
116views Hardware» more  ASPDAC 2006»
16 years 13 days ago
Post-routing redundant via insertion for yield/reliability improvement
- Reducing the yield loss due to via failure is one of the important problems in design for manufacturability. A well known and highly recommended method to improve via yield/relia...
Kuang-Yao Lee, Ting-Chi Wang
ACSD
2005
IEEE
169views Hardware» more  ACSD 2005»
16 years 3 days ago
Automating Synthesis of Asynchronous Communication Mechanisms
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed processes in digital systems. In previous work, syst...
Jordi Cortadella, Kyller Costa Gorgônio, Fei...