4894 search results - page 533 / 979 » The Guarding Problem - Complexity and Approximation |
153
click to vote
VMCAI
2010
Springer
16 years 2 months ago
2010
Springer
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
145
click to vote
ALT
2008
Springer
16 years 1 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
125
click to vote
ALT
2006
Springer
16 years 1 months ago
2006
Springer
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
104
click to vote
ICCAD
2003
IEEE
16 years 1 months ago
2003
IEEE
— In this paper we consider the problem of finding a smaller RLCM circuit that approximately replicates the behavior (up to a certain frequency) of a given RLCM circuit. Targeted...
146
click to vote
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Spectrum sensing, which monitors the spectrum activity, is studied for cognitive radio systems using multiple frequency bands with non-negligible band switching time (blind per...