Sciweavers

3677 search results - page 306 / 736
» Generalized Adaptive A*
Sort
View
DCG
2000
67views more  DCG 2000»
15 years 6 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 6 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
ORL
1998
116views more  ORL 1998»
15 years 6 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...
SIAMSC
2010
120views more  SIAMSC 2010»
15 years 5 months ago
Weighted Matrix Ordering and Parallel Banded Preconditioners for Iterative Linear System Solvers
The emergence of multicore architectures and highly scalable platforms motivates the development of novel algorithms and techniques that emphasize concurrency and are tolerant of ...
Murat Manguoglu, Mehmet Koyutürk, Ahmed H. Sa...
TCS
2010
15 years 5 months ago
Invariant games
In the context of 2-player removal games, we define the notion of invariant game for which each allowed move is independent of the position it is played from. We present a family ...
Éric Duchêne, Michel Rigo