Sciweavers

6833 search results - page 88 / 1367
» Some two-character sets
Sort
View
CORR
1999
Springer
65views Education» more  CORR 1999»
14 years 11 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe
JCO
1998
136views more  JCO 1998»
14 years 11 months ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
SIAMJO
2002
99views more  SIAMJO 2002»
14 years 11 months ago
Active Sets, Nonsmoothness, and Sensitivity
Nonsmoothness pervades optimization, but the way it typically arises is highly structured. Nonsmooth behavior of an objective function is usually associated, locally, with an activ...
A. S. Lewis
VTC
2010
IEEE
175views Communications» more  VTC 2010»
14 years 10 months ago
Sensitivity Analysis of the Optimal Parameter Settings of an LTE Packet Scheduler
—Advanced packet scheduling schemes in 3G/3G+ mobile networks provide one or more parameters to optimise the trade-off between QoS and resource efficiency. In this paper we stud...
I. Fernandez Diaz, Desislava C. Dimitrova, Kathlee...
CORR
2011
Springer
194views Education» more  CORR 2011»
14 years 7 months ago
Approachability of Convex Sets in Games with Partial Monitoring
We provide a necessary and sufficient condition under which a convex set is approachable in a game with partial monitoring, i.e. where players do not observe their opponents’ mo...
Vianney Perchet