6365 search results - page 114 / 1273 » Fast Local Computation Algorithms |
177
click to vote
STOC
1994
ACM
15 years 6 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
171
click to vote
QCQC
1998
Springer
15 years 6 months ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
112
click to vote
ICARCV
2008
IEEE
15 years 9 months ago
2008
IEEE
—In order to navigate safely, it is important to detect and to react to a potentially dangerous situation. Such a situation can be underlined by a judicious use of the locations ...
130
Voted
ICN
2005
Springer
15 years 8 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
126
Voted
BMCBI
2010
15 years 2 months ago
2010
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...