Sciweavers

849 search results - page 26 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
DSD
2007
IEEE
120views Hardware» more  DSD 2007»
14 years 2 months ago
Latency Minimization for Synchronous Data Flow Graphs
Synchronous Data Flow Graphs (SDFGs) are a very useful means for modeling and analyzing streaming applications. Some performance indicators, such as throughput, have been studied b...
Amir Hossein Ghamarian, Sander Stuijk, Twan Basten...
AAAI
2008
13 years 10 months ago
Computing Minimal Diagnoses by Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
WADS
2009
Springer
202views Algorithms» more  WADS 2009»
14 years 2 months ago
Minimal Locked Trees
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties...
Brad Ballinger, David Charlton, Erik D. Demaine, M...
CDC
2009
IEEE
111views Control Systems» more  CDC 2009»
14 years 14 days ago
Minimal dynamical structure realisations with application to network reconstruction from data
— Network reconstruction, i.e., obtaining network structure from data, is a central theme in systems biology, economics, and engineering. Previous work introduced dynamical struc...
Ye Yuan, Guy-Bart Vincent Stan, Sean Warnick, Jorg...
AAAI
2007
13 years 10 months ago
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
Subhash Suri, Elias Vicari, Peter Widmayer