Sciweavers

2143 search results - page 237 / 429
» corr 2010
Sort
View
CORR
2010
Springer
138views Education» more  CORR 2010»
15 years 6 months ago
Optimal Path Planning under Temporal Logic Constraints
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
Stephen L. Smith, Jana Tumova, Calin Belta, Daniel...
CORR
2010
Springer
140views Education» more  CORR 2010»
15 years 6 months ago
Automated Termination Analysis for Logic Programs with Cut
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...
Peter Schneider-Kamp, Jürgen Giesl, Thomas St...
CORR
2010
Springer
97views Education» more  CORR 2010»
15 years 6 months ago
Analysis of a Splitting Estimator for Rare Event Probabilities in Jackson Networks
We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed i...
Jose Blanchet, Kevin Leder, Yixi Shi
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 6 months ago
On Graph Crossing Number and Edge Planarization
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
Julia Chuzhoy, Yury Makarychev, Anastasios Sidirop...
CORR
2010
Springer
81views Education» more  CORR 2010»
15 years 6 months ago
On the size of identifying codes in triangle-free graphs
In an undirected graph G = (V, E), a subset C V such that C is a dominating set of G, and each vertex in V is dominated by a distinct subset of vertices from C, is called an iden...
Florent Foucaud, Ralf Klasing, Adrian Kosowski, An...