Sciweavers

5247 search results - page 285 / 1050
» The Generalized A* Architecture
Sort
View
IOR
2007
89views more  IOR 2007»
15 years 7 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
JUCS
2007
90views more  JUCS 2007»
15 years 7 months ago
High-level Structured Interactive Programs with Registers and Voices
Abstract: A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, pro...
Alexandru Popa, Alexandru Sofronia, Gheorghe Stefa...
AR
2004
107views more  AR 2004»
15 years 7 months ago
Inevitable collision states - a step towards safer robots?
-- An inevitable collision state for a robotic system can be defined as a state for which, no matter what the future trajectory followed by the system is, a collision with an obsta...
Thierry Fraichard, Hajime Asama
DCG
2000
67views more  DCG 2000»
15 years 7 months ago
A Theorem on Higher Bruhat Orders
We show that inclusion order and single-step inclusion coincide for higher Bruhat orders B(n; 2), i.e., B(n; 2) = B (n; 2). Mathematics Subject Classi cations (1991). 06A06, 51G05,...
Stefan Felsner, Helmut Weil
COMBINATORICS
1998
100views more  COMBINATORICS 1998»
15 years 7 months ago
Lattice Paths Between Diagonal Boundaries
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
Heinrich Niederhausen