Sciweavers

5699 search results - page 90 / 1140
» Alternating model trees
Sort
View
IJIS
2011
83views more  IJIS 2011»
14 years 7 months ago
Conceptual modeling in full computation-tree logic with sequence modal operator
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
Ken Kaneiwa, Norihiro Kamide
ICALP
2007
Springer
15 years 10 months ago
Bounded Depth Data Trees
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
Henrik Björklund, Mikolaj Bojanczyk
ENGL
2007
91views more  ENGL 2007»
15 years 4 months ago
RRT-based strategies for sensor-based exploration
—Real mobile robots should be able to build an abstract representation of the physical environment, in order to navigate and to work in such environment. We present a method for ...
Abraham Sánchez López, Judith Le&oac...
TMC
2012
13 years 6 months ago
Resource-Aware Video Multicasting via Access Gateways in Wireless Mesh Networks
—This paper studies video multicasting in large scale areas using wireless mesh networks. The focus is on the use of Internet access gateways that allow a choice of alternative r...
Wanqing Tu, Cormac J. Sreenan, Chun Tung Chou, Arc...