Sciweavers

4539 search results - page 563 / 908
» Approaches to Compute Workflow Complexity
Sort
View
ICMAS
2000
15 years 8 months ago
Integer Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...
Arne Andersson, Mattias Tenhunen, Fredrik Ygge
NIPS
1998
15 years 8 months ago
Dynamically Adapting Kernels in Support Vector Machines
The kernel-parameter is one of the few tunable parameters in Support Vector machines, controlling the complexity of the resulting hypothesis. Its choice amounts to model selection...
Nello Cristianini, Colin Campbell, John Shawe-Tayl...
NIPS
1998
15 years 8 months ago
A Polygonal Line Algorithm for Constructing Principal Curves
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...
Balázs Kégl, Adam Krzyzak, Tam&aacut...
PDPTA
2000
15 years 8 months ago
Performance Monitoring on an HPVM Cluster
Clusters of workstations are becoming popular platforms for parallel computing, but performance on these systems is more complex and harder to predict than on traditional parallel...
Geetanjali Sampemane, Scott Pakin, Andrew A. Chien
WCE
2007
15 years 7 months ago
Adaptive Automata Community Detection and Clustering: A generic methodology
— We present in this paper a generic methodology based on genetic automata for modelling community detection. With Communities, we deal with dynamic organizations which are self-...
Rawan Ghnemat, Cyrille Bertelle, Gérard Hen...