Sciweavers

2283 search results - page 241 / 457
» Bounds of Graph Characteristics
Sort
View
JEC
2006
61views more  JEC 2006»
13 years 8 months 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
SIGSOFT
2007
ACM
14 years 9 months ago
Program representations for testing wireless sensor network applications
Because of the growing complexity of wireless sensor network applications (WSNs), traditional software development tools are being developed that are specifically designed for the...
Nguyet T. M. Nguyen, Mary Lou Soffa
AUTOMATICA
2007
88views more  AUTOMATICA 2007»
13 years 8 months ago
Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence
In this paper, we generalize the notion of persistence, which has been originally introduced for two-dimensional formations, to Rd for d 3, seeking to provide a theoretical framew...
Changbin Yu, Julien M. Hendrickx, Baris Fidan, Bri...
DCC
2005
IEEE
14 years 8 months ago
The Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
Edwin R. van Dam
SPAA
2006
ACM
14 years 2 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...