Sciweavers

3038 search results - page 469 / 608
» High-Speed Function Approximation
Sort
View
JCDL
2005
ACM
84views Education» more  JCDL 2005»
15 years 10 months ago
Turning the page on navigation
In this paper, we discuss the findings of an in-depth observational study of reading and within-document navigation and add to these findings the results of a second analysis of h...
Catherine C. Marshall, Sara A. Bly
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
15 years 10 months ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
15 years 10 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
15 years 10 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
IPPS
2000
IEEE
15 years 9 months ago
Reduction Optimization in Heterogeneous Cluster Environments
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
Pangfeng Liu, Da-Wei Wang