Sciweavers

1971 search results - page 290 / 395
» Tabu search - Uncharted domains
Sort
View
ENTCS
2006
155views more  ENTCS 2006»
15 years 6 months ago
Mathematical Service Trading Based on Equational Matching
Mathematical software libraries provide many computational services. Mathematical operators properties can be used to combine several services in order to provide more complex one...
Aurélie Hurault, Marc Pantel
ASE
2005
140views more  ASE 2005»
15 years 6 months ago
Automated Procedure Construction for Deductive Synthesis
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
Steve Roach, Jeffrey Van Baalen
JASIS
2000
143views more  JASIS 2000»
15 years 6 months ago
Discovering knowledge from noisy databases using genetic programming
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
Man Leung Wong, Kwong-Sak Leung, Jack C. Y. Cheng
WWW
2009
ACM
16 years 7 months ago
Learning to recognize reliable users and content in social media with coupled mutual reinforcement
Community Question Answering (CQA) has emerged as a popular forum for users to pose questions for other users to answer. Over the last few years, CQA portals such as Naver and Yah...
Jiang Bian, Yandong Liu, Ding Zhou, Eugene Agichte...
WWW
2008
ACM
16 years 7 months ago
Matching independent global constraints for composite web services
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
Nalaka Gooneratne, Zahir Tari