8196 search results - page 204 / 1640 » Computational Modeling and Complexity Science |
171
click to vote
FOCS
1994
IEEE
15 years 10 months ago
1994
IEEE
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
163
click to vote
CSE
2008
IEEE
15 years 8 months ago
2008
IEEE
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
157
click to vote
CAD
1999
Springer
15 years 6 months ago
1999
Springer
The method of consecutive revolving or extrusion of a geometric entity in a CAD system is typically used by a designer to represent complex solids. While it is evident that consec...
160
click to vote
TCS
1998
15 years 6 months ago
1998
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
294
click to vote
CMSB
2011
Springer
14 years 6 months ago
2011
Springer
From the phosphorylation state of a molecule to the volume of a cell, parameters are ubiquitous in systems biology. At the same time, most models involve static or dynamic compart...