Sciweavers

1940 search results - page 243 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
169
Voted
TOOLS
2000
IEEE
15 years 11 months ago
A Case Study of Framework Design for Horizontal Reuse
In this experience report we present a case study in designing, implementing, and reusing an object-oriented framework for constructing and editing complex search expressions over...
Henrik Bærbak Christensen, Hebrick Rø...
228
Voted
JAIR
2006
157views more  JAIR 2006»
15 years 7 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
207
Voted
TASE
2008
IEEE
15 years 7 months ago
Randomized Optimal Design of Parallel Manipulators
This work intends to deal with the optimal kinematic synthesis problem of parallel manipulators under a unified framework. Observing that regular (e.g., hyper-rectangular) workspac...
Yunjiang Lou, Guanfeng Liu, Zexiang Li
219
Voted
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
16 years 12 days ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
198
Voted
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
15 years 6 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth