Sciweavers

29908 search results - page 76 / 5982
» On the Complexity of
Sort
View
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
14 years 4 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
ICRA
2005
IEEE
150views Robotics» more  ICRA 2005»
14 years 3 months ago
Complex Task Allocation For Multiple Robots
Abstract— Recent research trends and technology developments are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missions. ...
Robert Zlot, Anthony Stentz
FCT
2005
Springer
14 years 3 months ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
SIGOPSE
2004
ACM
14 years 3 months ago
An approach to benchmarking configuration complexity
Configuration is the process whereby components are assembled or adjusted to produce a functional system that operates at a specified level of performance. Today, the complexity o...
Aaron B. Brown, Joseph L. Hellerstein
MFCS
2004
Springer
14 years 3 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...