Sciweavers

2877 search results - page 278 / 576
» The Complexity of Planarity Testing
Sort
View
COR
2011
15 years 1 months ago
A Lagrangian heuristic for satellite range scheduling with resource constraints
The task of scheduling communications between satellites and ground control stations is getting more and more critical since an increasing number of satellites must be controlled ...
Fabrizio Marinelli, Salvatore Nocella, Fabrizio Ro...
ECCC
2011
205views ECommerce» more  ECCC 2011»
15 years 1 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 1 months ago
Simulating Cyber-Attacks for Fun and Profit
We introduce a new simulation platform called Insight, created to design and simulate cyber-attacks against large arbitrary target scenarios. Insight has surprisingly low hardware...
Ariel Futoransky, Fernando Miranda, José Ig...
TSP
2010
15 years 1 months ago
Optimal linear fusion for distributed detection via semidefinite programming
Consider the problem of signal detection via multiple distributed noisy sensors. We propose a linear decision fusion rule to combine the local statistics from individual sensors i...
Zhi Quan, Wing-Kin Ma, Shuguang Cui, Ali H. Sayed
SIAMNUM
2011
117views more  SIAMNUM 2011»
15 years 1 months ago
Construction and Convergence Study of Schemes Preserving the Elliptic Local Maximum Principle
We present a method to approximate (in any space dimension) diffusion equations with schemes having a specific structure; this structure ensures that the discrete local maximum a...
Jérôme Droniou, Christophe Le Potier