Sciweavers

6894 search results - page 1298 / 1379
» Generation Problems
Sort
View
AI
2005
Springer
15 years 11 months ago
Instance Cloning Local Naive Bayes
The instance-based k-nearest neighbor algorithm (KNN)[1] is an effective classification model. Its classification is simply based on a vote within the neighborhood, consisting o...
Liangxiao Jiang, Harry Zhang, Jiang Su
ATAL
2005
Springer
15 years 11 months ago
A cooperative multi-agent approach to free flight
The next generation of air traffic control will require automated decision support systems in order to meet safety, reliability, flexibility, and robustness demands in an environ...
Jared C. Hill, F. Ryan Johnson, James K. Archibald...
ATAL
2005
Springer
15 years 11 months ago
An agent-based approach for managing symbiotic simulation of semiconductor assembly and test operation
The rapid changing business environment of high-tech asset intensive enterprises such as semiconductor manufacturing constantly drives production managers to look for better solut...
Malcolm Yoke-Hean Low, Kong Wei Lye, Peter Lenderm...
CIKM
2005
Springer
15 years 11 months ago
A function-based access control model for XML databases
XML documents are frequently used in applications such as business transactions and medical records involving sensitive information. Typically, parts of documents should be visibl...
Naizhen Qi, Michiharu Kudo, Jussi Myllymaki, Hamid...
COCO
2005
Springer
123views Algorithms» more  COCO 2005»
15 years 11 months ago
If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
« Prev « First page 1298 / 1379 Last » Next »