Sciweavers

619 search results - page 117 / 124
» Generic Extensions and Generic Polynomials
Sort
View
CIDM
2009
IEEE
15 years 10 months ago
An architecture and algorithms for multi-run clustering
—This paper addresses two main challenges for clustering which require extensive human effort: selecting appropriate parameters for an arbitrary clustering algorithm and identify...
Rachsuda Jiamthapthaksin, Christoph F. Eick, Vadee...
AGENTS
2001
Springer
15 years 10 months ago
Matchmaking for autonomous agents in electronic marketplaces
Matchmaking is the process of mediating demand and supply based on profile information. Matchmaking plays a crucial role in agent-based electronic marketplaces: the problem to be ...
Daniel Veit, Jörg P. Müller, Martin Schn...
DL
1999
Springer
166views Digital Library» more  DL 1999»
15 years 10 months ago
Semantic Indexing for a Complete Subject Discipline
As part of the Illinois Digital Library Initiative (DLI) project we developed “scalable semantics” technologies. These statistical techniques enabled us to index large collect...
Yi-Ming Chung, Qin He, Kevin Powell, Bruce R. Scha...
KBSE
1998
IEEE
15 years 10 months ago
Explaining Synthesized Software
Motivated by NASA's need for high-assurance software, NASA Ames' Amphion project has developed a generic program generation system based on deductive synthesis. Amphion ...
Jeffrey Van Baalen, Peter Robinson, Michael R. Low...
POPL
1989
ACM
15 years 10 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott