Sciweavers

1884 search results - page 243 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
COOPIS
2000
IEEE
15 years 9 months ago
Dynamic Pricing with Limited Competitor Information in a Multi-Agent Economy
We study the price dynamics in a multi-agent economy consisting of buyers and competing sellers, where each seller has limited information about its competitors’ prices. In this ...
Prithviraj Dasgupta, Rajarshi Das
ISCA
2000
IEEE
63views Hardware» more  ISCA 2000»
15 years 9 months ago
An embedded DRAM architecture for large-scale spatial-lattice computations
Spatial-lattice computations with finite-range interactions are an important class of easily parallelized computations. This class includes many simple and direct algorithms for ...
Norman Margolus
SPIRE
1998
Springer
15 years 9 months ago
Direct Pattern Matching on Compressed Text
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 8 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
POPL
1995
ACM
15 years 8 months ago
Parametric Program Slicing
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
John Field, G. Ramalingam, Frank Tip