Sciweavers

17329 search results - page 3335 / 3466
» Improved non-approximability results
Sort
View
AGENTS
1998
Springer
15 years 10 months ago
A Synergy of Agent Components: Social Comparison for Failure Detection
of other components. This abstract presents an implemented illustration of such explicit component synergy and its usefulness in dynamic multi-agent environments. In such environme...
Gal A. Kaminka, Milind Tambe
NPIV
1998
ACM
108views Visualization» more  NPIV 1998»
15 years 10 months ago
Visualization for situation awareness
We explore techniques from visualization and computational geometry to make tactical information more intuitive to a military commander. To be successful, the commander must quick...
C. M. Hoffman, Y.-J. Kim, R. P. Winkler, J. D. Wal...
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 10 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
EPS
1998
Springer
15 years 10 months ago
Variable-Dimensional Optimization with Evolutionary Algorithms Using Fixed-Length Representations
This paper discusses a simple representation of variable-dimensional optimization problems for evolutionary algorithms. Although it was successfully applied to the optimization of ...
Joachim Sprave, Susanne Rolf
ICS
1998
Tsinghua U.
15 years 10 months ago
Load Execution Latency Reduction
In order to achieve high performance, contemporary microprocessors must effectively process the four major instruction types: ALU, branch, load, and store instructions. This paper...
Bryan Black, Brian Mueller, Stephanie Postal, Ryan...
« Prev « First page 3335 / 3466 Last » Next »