Sciweavers

14165 search results - page 374 / 2833
» The generalized two-server problem
Sort
View
MCU
2007
123views Hardware» more  MCU 2007»
15 years 8 months ago
Study of Limits of Solvability in Tag Systems
Abstract. In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. Thi...
Liesbeth De Mol
ENTCS
2008
80views more  ENTCS 2008»
15 years 6 months ago
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs
Consider the initial-value problem with computable parameters dx dt = p(t, x) x(t0) = x0, where p : Rn+1 Rn is a vector of polynomials and (t0, x0) Rn+1 . We show that the proble...
Daniel S. Graça, Jorge Buescu, Manuel Lamei...
198
Voted
JCT
2008
120views more  JCT 2008»
15 years 6 months ago
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
Tamás Király, Lap Chi Lau
ORL
2008
82views more  ORL 2008»
15 years 6 months ago
On test sets for nonlinear integer maximization
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...
Jon Lee, Shmuel Onn, Robert Weismantel
ORL
2008
87views more  ORL 2008»
15 years 5 months ago
On-line scheduling with non-crossing constraints
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
Lele Zhang, Kwanniti Khammuang, Andrew Wirth