Sciweavers

11211 search results - page 364 / 2243
» Data Structures
Sort
View
ATAL
2008
Springer
15 years 8 months ago
A best-first anytime algorithm for computing optimal coalition structures
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
Chattrakul Sombattheera, Aditya Ghose
ICML
2009
IEEE
16 years 7 months ago
Boosting with structural sparsity
Despite popular belief, boosting algorithms and related coordinate descent methods are prone to overfitting. We derive modifications to AdaBoost and related gradient-based coordin...
John Duchi, Yoram Singer
ICSOC
2003
Springer
15 years 12 months ago
Semantic Structure Matching for Assessing Web-Service Similarity
The web-services stack of standards is designed to support the reuse and interoperation of software components on the web. A critical step in the process of developing applications...
Yiqiao Wang, Eleni Stroulia
APIN
2007
118views more  APIN 2007»
15 years 6 months ago
Using genetic algorithms to reorganize superpeer structure in peer to peer networks
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
Jaymin Kessler, Khaled Rasheed, Ismailcem Budak Ar...
CSREASAM
2006
15 years 8 months ago
Integrating the Generalized-Honeycomb-Torus for Sustainable Parking Structures in the Globalizing Age
Considering disaster sensitivity especially in developing large-scale, multiple-use parking structures, we propose dual-surveillance based SCADA (supervisory control and data acqui...
Hsun-Jung Cho, Li-Yen Hsu