Sciweavers

9572 search results - page 308 / 1915
» Cover Algorithms and Their Combination
Sort
View
EUROPAR
2007
Springer
16 years 25 days ago
Decision Trees and MPI Collective Algorithm Selection Problem
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
Jelena Pjesivac-Grbovic, George Bosilca, Graham E....
SAGA
2007
Springer
16 years 23 days ago
A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
Walter J. Gutjahr, Stefan Katzensteiner, Peter Rei...
IAT
2006
IEEE
16 years 22 days ago
Generic Command Interpretation Algorithms for Conversational Agents
AbstractThis paper focuses on human-machine communication with intelligent agents, it proposes a generic architecture with an algorithm for natural language (NL) command interpreta...
Laurent Mazuel, Nicolas Sabouret
IAT
2006
IEEE
16 years 22 days ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
INFSOF
2006
73views more  INFSOF 2006»
15 years 6 months ago
Theory and algorithms for slicing unstructured programs
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...
Mark Harman, Arun Lakhotia, David Binkley