Sciweavers

5599 search results - page 898 / 1120
» Abstract State Services
Sort
View
ESA
2010
Springer
172views Algorithms» more  ESA 2010»
15 years 6 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Michael Lampis
141
Voted
GLOBECOM
2008
IEEE
15 years 5 months ago
Energy-Efficient Transmission in Frequency-Selective Channels
Abstract--Energy efficiency is becoming increasingly important for small form factor mobile devices, as battery technology has not kept up with the growing requirements stemming fr...
Guowang Miao, Nageen Himayat, Ye (Geoffrey) Li
191
Voted
AAMAS
2010
Springer
15 years 5 months ago
Teaching a pet-robot to understand user feedback through interactive virtual training tasks
Abstract In this paper, we present a human-robot teaching framework that uses "virtual" games as a means for adapting a robot to its user through natural interaction in a...
Anja Austermann, Seiji Yamada
135
Voted
ACTA
2007
90views more  ACTA 2007»
15 years 5 months ago
Well-structured languages
Abstract This paper introduces the notion of well-structured language. A wellstructured language can be defined by a labelled well-structured transition system, equipped with an u...
Gilles Geeraerts, Jean-François Raskin, Lau...
148
Voted
ALGORITHMICA
2010
188views more  ALGORITHMICA 2010»
15 years 5 months ago
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
Katerina Asdre, Stavros D. Nikolopoulos