Sciweavers

6574 search results - page 1254 / 1315
» Current Signatures: Application
Sort
View
ERLANG
2008
ACM
13 years 9 months ago
Gradual typing of erlang programs: a wrangler experience
Currently most Erlang programs contain no or very little type information. This sometimes makes them unreliable, hard to use, and difficult to understand and maintain. In this pap...
Konstantinos F. Sagonas, Daniel Luna
ESWS
2008
Springer
13 years 9 months ago
Rabbit: Developing a Control Natural Language for Authoring Ontologies
: The mathematical nature of description logics has meant that domain experts find them hard to understand. This forms a significant impediment to the creation and adoption of onto...
Glen Hart, Martina Johnson, Catherine Dolbear
ATMOS
2007
13 years 9 months ago
Maintenance of Multi-level Overlay Graphs for Timetable Queries
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
ADBIS
2010
Springer
192views Database» more  ADBIS 2010»
13 years 9 months ago
The Objects Interaction Graticule for Cardinal Direction Querying in Moving Objects Data Warehouses
Cardinal directions have turned out to be very important qualitative spatial relations due to their numerous applications in spatial wayfinding, GIS, qualitative spatial reasoning ...
Ganesh Viswanathan, Markus Schneider
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 9 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
« Prev « First page 1254 / 1315 Last » Next »