Sciweavers

2412 search results - page 149 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
117
Voted
FMSD
2007
133views more  FMSD 2007»
15 years 3 months ago
Static priority scheduling of event-triggered real-time embedded systems
Real-time embedded systems are often specified as a collection of independent tasks, each generating a sequence of event-triggered code blocks, and the scheduling in this domain ...
Cagkan Erbas, Andy D. Pimentel, Selin Cerav-Erbas
119
Voted
JACM
2000
119views more  JACM 2000»
15 years 3 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
131
Voted
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 3 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
170
Voted
ICASSP
2011
IEEE
14 years 7 months ago
On the identification of parametric underspread linear systems
Identification of time-varying linear systems, which introduce both time-shifts (delays) and frequency-shifts (Doppler-shifts), is a central task in many engineering applications...
Waheed U. Bajwa, Kfir Gedalyahu, Yonina C. Eldar
180
Voted
STACS
2012
Springer
13 years 11 months ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...