Sciweavers

42230 search results - page 389 / 8446
» Algorithms and Complexity Results for
Sort
View
IJCAI
2007
15 years 8 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
COSIT
2003
Springer
132views GIS» more  COSIT 2003»
16 years 1 days ago
"Simplest" Paths: Automated Route Selection for Navigation
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
Matt Duckham, Lars Kulik
SIGGRAPH
1997
ACM
15 years 11 months ago
Rendering complex scenes with memory-coherent ray tracing
Simulating realistic lighting and rendering complex scenes are usually considered separate problems with incompatible solutions. Accurate lighting calculations are typically perfo...
Matt Pharr, Craig E. Kolb, Reid Gershbein, Pat Han...
VTC
2008
IEEE
104views Communications» more  VTC 2008»
16 years 1 months ago
Low Complexity Acquisition of UWB Telemetry Data Packets with Clock Offset
—In this paper, low complexity acquisition of UWB telemetry data packets is addressed. In addition to the usual channel impairments considered of additive white Gaussian noise (A...
Saeed Khalesehosseini, John Nielsen
AAIM
2006
Springer
75views Algorithms» more  AAIM 2006»
16 years 25 days ago
Subsequence Packing: Complexity, Approximation, and Application
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
Minghui Jiang