Sciweavers

485 search results - page 29 / 97
» Unconstraint Assignment Problem: A Molecular Computing Appro...
Sort
View
CVPR
2011
IEEE
12 years 11 months ago
Max-margin Clustering: Detecting Margins from Projections of Points on Lines
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
Raghuraman Gopalan, Jagan Sankaranarayanan
IPPS
2008
IEEE
14 years 2 months ago
Decentralized market-based resource allocation in a heterogeneous computing system
We present a decentralized market-based approach to resource allocation in a heterogeneous overlay network. The presented resource allocation strategy assigns overlay network reso...
Jay Smith, Edwin K. P. Chong, Anthony A. Maciejews...
COR
2010
127views more  COR 2010»
13 years 7 months ago
Discrepancy search for the flexible job shop scheduling problem
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
Abir Ben Hmida, Mohamed Haouari, Marie-José...
IJCAI
2003
13 years 9 months ago
Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...
Laurence A. Kramer, Stephen F. Smith
IPPS
2010
IEEE
13 years 5 months ago
Dynamic load balancing on single- and multi-GPU systems
The computational power provided by many-core graphics processing units (GPUs) has been exploited in many applications. The programming techniques currently employed on these GPUs...
Long Chen, Oreste Villa, Sriram Krishnamoorthy, Gu...