Sciweavers

2519 search results - page 290 / 504
» Reasoning with Textual Cases
Sort
View
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
16 years 1 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
PPDP
2009
Springer
16 years 1 months ago
Dependent type inference with interpolants
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
Hiroshi Unno, Naoki Kobayashi
ICRA
2008
IEEE
141views Robotics» more  ICRA 2008»
16 years 1 months ago
Reciprocal Velocity Obstacles for real-time multi-agent navigation
— In this paper, we propose a new concept — the “Reciprocal Velocity Obstacle”— for real-time multi-agent navigation. We consider the case in which each agent navigates i...
Jur P. van den Berg, Ming C. Lin, Dinesh Manocha
LICS
2008
IEEE
16 years 1 months ago
A Logical Characterization of Individual-Based Models
Individual-based models are a relatively new approach to modelling dynamical systems of interacting entities, for example molecules in a biological cell. Although they are computa...
James F. Lynch
LICS
2008
IEEE
16 years 1 months ago
Context Matching for Compressed Terms
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
Adria Gascón, Guillem Godoy, Manfred Schmid...