1686 search results - page 214 / 338 » Programs as polygraphs: computability and complexity |
157
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
158
click to vote
JIRS
2008
15 years 4 months ago
2008
Abstract This paper proposes an approach for reducing the computational complexity of a model-predictive-control strategy for discrete-time hybrid systems with discrete inputs only...
ENTCS
2007
15 years 4 months ago
2007
Service oriented computing is an emerging paradigm for programming distributed applications based on services. Services are simple software elements that supply their functionalit...
146
click to vote
VLSID
2004
IEEE
16 years 4 months ago
2004
IEEE
The increasing software content of battery-powered embedded systems has fueled much interest in techniques for developing energyefficient embedded software. Source code transforma...
144
click to vote
PODS
2007
ACM
16 years 4 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...