Sciweavers

245 search results - page 26 / 49
» Locating phase transitions in computationally hard problems
Sort
View
GROUP
1993
ACM
13 years 11 months ago
Development of multiple media documents
: Development of documents in multiple media involves activities in three different fields, the technical, the discoursive and the procedural. The major development problems of art...
Stephen J. Morris, Anthony Finkelstein
IPPS
2005
IEEE
14 years 1 months ago
A Distributed Procedure for Bandwidth-Centric Scheduling of Independent-Task Applications
The problem of scheduling independent tasks on heterogeneous trees is considered. The nodes of the tree may have different processing times, and links different communication time...
Cyril Banino
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
14 years 4 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 5 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
ANOR
2011
101views more  ANOR 2011»
13 years 2 months ago
The case for strategic oscillation
Hard problems for metaheuristic search can be a source of insight for developing better methods. We examine a challenging instance of such a problem that has exactly two local opt...
Fred Glover, Jin-Kao Hao