Sciweavers

9842 search results - page 1837 / 1969
» Problem complexity
Sort
View
125
Voted
CIKM
2009
Springer
15 years 7 months ago
Mining linguistic cues for query expansion: applications to drug interaction search
Given a drug under development, what are other drugs or biochemical compounds that it might interact with? Early answers to this question, by mining the literature, are valuable f...
Sheng Guo, Naren Ramakrishnan
88
Voted
GLVLSI
2007
IEEE
158views VLSI» more  GLVLSI 2007»
15 years 7 months ago
Design of a versatile and cost-effective hybrid floating-point/LNS arithmetic processor
LNS (logarithmic number system) arithmetic has the advantages of high-precision and high performance in complex function computation. However, the large hardware problem in LNS ad...
Chichyang Chen, Paul Chow
ATAL
2005
Springer
15 years 6 months ago
On the dynamics of delegation, cooperation, and control: a logical account
We present dcl-pc: a dynamic logic of delegation and cooperation. The logical foundation of dcl-pc is cl-pc, a logic for reasoning about cooperation in which the powers of agents ...
Wiebe van der Hoek, Michael Wooldridge
109
Voted
ICCS
2005
Springer
15 years 6 months ago
Self-optimization of Large Scale Wildfire Simulations
The development of efficient parallel algorithms for large scale wildfire simulations is a challenging research problem because the factors that determine wildfire behavior are com...
Jingmei Yang, Huoping Chen, Salim Hariri, Manish P...
FOCS
1999
IEEE
15 years 5 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
« Prev « First page 1837 / 1969 Last » Next »