Sciweavers

8132 search results - page 1310 / 1627
» Dependability, Abstraction, and Programming
Sort
View
ERCIMDL
2010
Springer
163views Education» more  ERCIMDL 2010»
15 years 7 months ago
Determining Time of Queries for Re-ranking Search Results
Abstract. Recent work on analyzing query logs shows that a significant fraction of queries are temporal, i.e., relevancy is dependent on time, and temporal queries play an importan...
Nattiya Kanhabua, Kjetil Nørvåg
GISCIENCE
2008
Springer
141views GIS» more  GISCIENCE 2008»
15 years 7 months ago
Simplest Instructions: Finding Easy-to-Describe Routes for Navigation
Abstract. Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However...
Kai-Florian Richter, Matt Duckham
189
Voted
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
15 years 6 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
ARC
2010
Springer
154views Hardware» more  ARC 2010»
15 years 6 months ago
Perspectives on system identification
: System identification is the art and science of building mathematical models of dynamic systems from observed input-output data. It can be seen as the interface between the real ...
Lennart Ljung
CORR
2010
Springer
79views Education» more  CORR 2010»
15 years 6 months ago
Quantitative Games on Probabilistic Timed Automata
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Triv...
« Prev « First page 1310 / 1627 Last » Next »