Sciweavers

14165 search results - page 513 / 2833
» The generalized two-server problem
Sort
View
DAM
2008
78views more  DAM 2008»
15 years 7 months ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...
EJC
2010
15 years 7 months ago
Dualities in full homomorphisms
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
Richard N. Ball, Jaroslav Nesetril, Ales Pultr
AUTOMATICA
2006
91views more  AUTOMATICA 2006»
15 years 7 months ago
Necessary and sufficient conditions for reachability on a simplex
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
Bartek Roszak, Mireille E. Broucke
CORR
2007
Springer
75views Education» more  CORR 2007»
15 years 7 months ago
Polyhedral representation conversion up to symmetries
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. In particular we discuss decompo...
David Bremner, Mathieu Dutour Sikiric, Achill Sch&...
IPL
2006
99views more  IPL 2006»
15 years 7 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti