Sciweavers

239 search results - page 27 / 48
» The path partition problem and related problems in bipartite...
Sort
View
DM
2002
95views more  DM 2002»
13 years 7 months ago
On the superconnectivity of generalized p-cycles
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
Camino Balbuena, Ignacio M. Pelayo, J. Góme...
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
14 years 23 days ago
Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
Brian S. Mitchell, Spiros Mancoridis
JCSS
1998
51views more  JCSS 1998»
13 years 7 months ago
Randomized Query Processing in Robot Path Planning
d Abstract) LYDIA E. KAVRAKI   JEAN-CLAUDE LATOMBE   RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...
Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motw...
SRDS
2010
IEEE
13 years 5 months ago
Shedding Light on Enterprise Network Failures Using Spotlight
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
Dipu John, Pawan Prakash, Ramana Rao Kompella, Ran...
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
14 years 7 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...