Sciweavers

2503 search results - page 329 / 501
» A study of 3-arc graphs
Sort
View
BMCBI
2006
141views more  BMCBI 2006»
15 years 5 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
IJSI
2008
126views more  IJSI 2008»
15 years 5 months ago
Modelling Route Instructions for Robust Human-Robot Interaction on Navigation Tasks
In this paper, we demonstrate the use of qualitative spatial modelling as the foundation for the conceptual representation of route instructions, to enable robust humanrobot intera...
Hui Shi, Bernd Krieg-Brückner
171
Voted
ENTCS
2007
103views more  ENTCS 2007»
15 years 5 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
EOR
2007
158views more  EOR 2007»
15 years 5 months ago
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa...
TPDS
2008
136views more  TPDS 2008»
15 years 5 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...