Sciweavers

9842 search results - page 1894 / 1969
» Problem complexity
Sort
View
PLDI
2003
ACM
14 years 4 months ago
Meta optimization: improving compiler heuristics with machine learning
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
Mark Stephenson, Saman P. Amarasinghe, Martin C. M...
SIGCOMM
2003
ACM
14 years 4 months ago
A knowledge plane for the internet
We propose a new objective for network research: to build a fundamentally different sort of network that can assemble itself given high level instructions, reassemble itself as re...
David D. Clark, Craig Partridge, J. Christopher Ra...
SPAA
2003
ACM
14 years 4 months ago
The effect of communication costs in solid-state quantum computing architectures
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Freder...
XMLSEC
2003
ACM
14 years 4 months ago
Access control of XML documents considering update operations
As a large quantity of information is presented in XML format on the Web, there are increasing demands for XML security. Until now, research on XML security has been focused on th...
Chung-Hwan Lim, Seog Park, Sang Hyuk Son
ADC
2003
Springer
106views Database» more  ADC 2003»
14 years 4 months ago
Database Component Ware
Database modeling is still a job of an artisan. Due to this approach database schemata evolve by growth without any evolution plan. Finally, they cannot be examined, surveyed, con...
Bernhard Thalheim
« Prev « First page 1894 / 1969 Last » Next »