Sciweavers

973 search results - page 152 / 195
» New Bounds on Crossing Numbers
Sort
View
WABI
2009
Springer
16 years 21 days ago
MADMX: A Novel Strategy for Maximal Dense Motif Extraction
We develop, analyze and experiment with a new tool, called madmx, which extracts frequent motifs, possibly including don’t care characters, from biological sequences. We introduc...
Roberto Grossi, Andrea Pietracaprina, Nadia Pisant...
FM
2009
Springer
157views Formal Methods» more  FM 2009»
16 years 21 days ago
Symbolic Predictive Analysis for Concurrent Programs
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
Chao Wang, Sudipta Kundu, Malay K. Ganai, Aarti Gu...
CDC
2008
IEEE
112views Control Systems» more  CDC 2008»
16 years 18 days ago
Application of the proximal center decomposition method to distributed model predictive control
Abstract— In this paper we present a dual-based decomposition method, called here the proximal center method, to solve distributed model predictive control (MPC) problems for cou...
Ion Necoara, Dang Doan, Johan A. K. Suykens
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
16 years 18 days ago
On the structure of graph edge designs that optimize the algebraic connectivity
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
Yan Wan, Sandip Roy, Xu Wang, Ali Saberi, Tao Yang...
INFOCOM
2008
IEEE
16 years 16 days ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff