1355 search results - page 119 / 271 » Alternating Timed Automata over Bounded Time |
CIC
2004
13 years 10 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
SOFSEM
2007
Springer
14 years 3 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
FOCS
1995
IEEE
14 years 20 days ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...